Sciweavers

16725 search results - page 2768 / 3345
» Engineering Software Correctness
Sort
View
FOSSACS
2007
Springer
16 years 1 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
FOSSACS
2007
Springer
16 years 1 months ago
PDL with Intersection and Converse Is 2 EXP-Complete
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
Stefan Göller, Markus Lohrey, Carsten Lutz
FSEN
2007
Springer
16 years 1 months ago
Adapting the UPPAAL Model of a Distributed Lift System
Abstract. Groote, Pang and Wouters (2001) analyzed an existing distributed lift system using the process algebraic toolset µCRL. Pang, Karstens and Fokkink (2003) analyzed a redes...
Wan Fokkink, Allard Kakebeen, Jun Pang
FSEN
2007
Springer
16 years 1 months ago
Hoare Logic for ARM Machine Code
This paper shows how a machine-code Hoare logic is used to lift reasoning from the tedious operational model of a machine lana manageable level of abstraction without making simpli...
Magnus O. Myreen, Anthony C. J. Fox, Michael J. C....
FSEN
2007
Springer
16 years 1 months ago
Logical Bisimulations and Functional Languages
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be the proof of congruence and, related to this, enhancements of the bisimul...
Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
« Prev « First page 2768 / 3345 Last » Next »