3440 search results - page 493 / 688 » Logics For Context-Free Languages |
174
click to vote
APSEC
2003
IEEE
15 years 10 months ago
2003
IEEE
Using the language Z for more than specification is hindered by the fact that its algebra of schemas is not monotonic with respect to refinement; so specification is modular, but ...
150
click to vote
IWMM
2000
Springer
15 years 10 months ago
2000
Springer
We extend Tofte and Talpin's region-based model for memory management to support backtracking and cuts, which makes it suitable for use with Prolog and other logic programmin...
209
click to vote
ASM
2010
ASM
15 years 9 months ago
2010
ASM
Abstract. Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments therefore depends direct...
193
click to vote
CLIMA
2010
15 years 8 months ago
2010
We present an algorithm for finding uniform strategies in multi-agent systems with incomplete information. The algorithm finds all maximal uniform strategies for agents with incomp...
186
click to vote
VVEIS
2008
15 years 8 months ago
2008
This paper presents an executable semantics of OO models. We made it possible to conduct both simulation and theorem proving on the semantics by implementing its underlying heap me...