2012
SatX10: A Scalable Plug&Play Parallel SAT Framework - (Tool Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012
Robust scripting via patterns.
Proceedings of the 8th Symposium on Dynamic Languages, 2012
2009
Ferret: Programming language support for multiple dynamic classification.
Comput. Lang. Syst. Struct., 2009
Thorn: robust concurrent scripting on the JVM.
Proceedings of the Companion to the 24th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2009
Thorn: robust, concurrent, extensible scripting on the JVM.
Proceedings of the 24th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2009
2008
Matchete: Paths through the Pattern Matching Jungle.
Proceedings of the Practical Aspects of Declarative Languages, 2008
2006
Architectural thinking and modeling with the Architects' Workbench.
IBM Syst. J., 2006
2005
Lopsided Little Languages: Experience with XQuery.
Proceedings of the Second International Workshop on XQuery Implementation, 2005
2004
Precongruence formats for decorated trace semantics.
ACM Trans. Comput. Log., 2004
2000
Precongruence Formats for Decorated Trace Preorders.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000
1997
Using a Protean Language to Enhance Expressiveness in Specification.
IEEE Trans. Software Eng., 1997
1995
Structural Operational Semantics for Weak Bisimulations.
Theor. Comput. Sci., 1995
Transformational Design and Implementation of a New Efficient Solution to the Ready Simulation Problem.
Sci. Comput. Program., 1995
Bisimulation Can't be Traced.
J. ACM, 1995
Structured Operational Semantics as a Specification Language.
Proceedings of the Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995
On the Expressive Power of CCS.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995
Generating BDD Models for Process Algebra Terms.
Proceedings of the Computer Aided Verification, 1995
1994
Turning SOS Rules into Equations
Inf. Comput., May, 1994
Self-sufficiency and critical thinking in the programming languages course.
ACM SIGCSE Bull., 1994
When is Partial Trace Equivalence Adequate?
Formal Aspects Comput., 1994
CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms.
Proceedings of the Conference Record of POPL'94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1994
1993
Structured Operational Sematics for Process Algebras and Equational Axiom Systems.
Proceedings of the CONCUR '93, 1993
1992
Experimenting with Process Equivalence.
Theor. Comput. Sci., 1992
Compiling Joy Into Silicon: An Exercise in Applied Structural Operational Semantics.
Proceedings of the Sematics: Foundations and Applications, 1992
Computing Ready Simulations Efficiently.
Proceedings of the NAPAW 92, 1992
1991
Putting Time into Proof Outlines.
Proceedings of the Real-Time: Theory in Practice, 1991
Trade-Offs in True Concurrency: Pomsets and Mazurkiewicz Traces.
Proceedings of the Mathematical Foundations of Programming Semantics, 1991
1990
Can LCF be Topped? Flat Lattice Models of Typed lambda-Calculus
Inf. Comput., 1990
1989
A Remark on Bisimulation Between Probabilistic Processes.
Proceedings of the Logic at Botik '89, 1989
1988
Constructing Two-Writer Atomic Registers.
IEEE Trans. Computers, 1988
Can LCF Be Topped? Flat Lattice models of Typed Lambda Calculus (Preliminary Report)
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988