14 search results - page 2 / 3 » SELP - A System for Studying Strong Equivalence Between Logi... |
ICALP
1998
Springer
13 years 9 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
ICLP
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. In this doctoral work we aim at developing a new approach to labelled semantics and equivalences for the Concurrent Constraint Programming (CCP) which will enable a broad...
SCP
2010
13 years 3 months ago
2010
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
ICLP
2009
Springer
14 years 5 months ago
2009
Springer
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...