632 search results - page 109 / 127 » Combining programming with theorem proving |
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
In this work we further investigate the relation, first found by Truszczy´nski, between modal logic S4F and Default Logic (DL), analyzing some interesting properties and showing ...
COCO
2011
Springer
12 years 7 months ago
2011
Springer
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
IPL
2010
13 years 5 months ago
2010
cally Refining Abstract Interpretations Bhargav S. Gulavani1 , Supratik Chakraborty1 , Aditya V. Nori2 , and Sriram K. Rajamani2 1 IIT Bombay 2 Microsoft Research India Abstract. A...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...