Sciweavers

545 search results - page 94 / 109
» Recursive logic frames
Sort
View
KBSE
2007
IEEE
15 years 4 months ago
Sequential circuits for program analysis
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
LICS
2007
IEEE
15 years 4 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic
LICS
2007
IEEE
15 years 4 months ago
A Robust Class of Context-Sensitive Languages
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
ICALP
2007
Springer
15 years 3 months 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...
66
Voted
ATAL
2005
Springer
15 years 3 months ago
Agent synthesis: partnership and agreement in cooperative mobile agents
This work focuses on an emerging extension to traditional agent models, called Hierarchical Mobile Agents model, where an agent can contain other agents recursively. The model ena...
Fuyuki Ishikawa, Yasuyuki Tahara, Nobukazu Yoshiok...