Sciweavers

4257 search results - page 440 / 852
» The Logical Modularity of Programs
Sort
View
APN
2003
Springer
16 years 1 days ago
The Model-Checking Kit
The Model-Checking Kit [8] is a collection of programs which allow to model finite state systems using a variety of modelling languages, and verify them using a variety of checker...
Claus Schröter, Stefan Schwoon, Javier Esparz...
WOLLIC
2010
Springer
15 years 12 months ago
The Two-Variable Fragment with Counting Revisited
The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting were shown in [5] to be in NExpTime. This paper presents ...
Ian Pratt-Hartmann
ENTCS
2008
85views more  ENTCS 2008»
15 years 6 months ago
Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking
In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning technique of logical relations in a case study about equivalence checking. He pr...
Julien Narboux, Christian Urban
ICFP
2006
ACM
16 years 6 months ago
The missing link: dynamic components for ML
Despite its powerful module system, ML has not yet evolved for the modern world of dynamic and open modular programming, to which more primitive languages have adapted better so f...
Andreas Rossberg
AOSD
2005
ACM
16 years 11 days ago
Role-based refactoring of crosscutting concerns
Improving the structure of code can help developers work with a software system more efficiently and more consistently. To aid developers in re-structuring the implementation of c...
Jan Hannemann, Gail C. Murphy, Gregor Kiczales