Sciweavers

9370 search results - page 155 / 1874
» An Abstract Notion of Application
Sort
View
TPHOL
2009
IEEE
16 years 1 months ago
Formalising Observer Theory for Environment-Sensitive Bisimulation
Abstract. We consider a formalisation of a notion of observer (or intruder) theories, commonly used in symbolic analysis of security protocols. An observer theory describes the kno...
Jeremy E. Dawson, Alwen Tiu
CIE
2009
Springer
16 years 1 months ago
Program Self-reference in Constructive Scott Subdomains
Abstract. Intuitively, a recursion theorem asserts the existence of selfreferential programs. Two well-known recursion theorems are Kleene’s Recursion Theorem (krt) and Rogers’...
John Case, Samuel E. Moelius
LPNMR
2009
Springer
16 years 1 months ago
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
Abstract. In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at s...
Jörg Pührer, Hans Tompits
ICALP
2007
Springer
16 years 20 days ago
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
LPNMR
2007
Springer
16 years 20 days ago
Head-Elementary-Set-Free Logic Programs
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
Martin Gebser, Joohyung Lee, Yuliya Lierler