2152 search results - page 191 / 431 » On Automating the Calculus of Relations |
180
click to vote
KGC
1997
Springer
15 years 10 months ago
1997
Springer
Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting p...
159
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
The original semantics of Evaluation Logic in [Mog93] relies on additional properties of strong monads. This paper extends the original semantics by dropping all additional requir...
181
click to vote
ICTL
1994
15 years 10 months ago
1994
In this paper we present a survey of work relating to the Concurrent METATEM programming language. In addition to a description of the basic Concurrent METATEM system, which incorp...
134
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
173
click to vote
CSL
2004
Springer
15 years 10 months ago
2004
Springer
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...