888 search results - page 95 / 178 » The Power of Temporal Proofs |
JOLLI
2010
14 years 8 months ago
2010
rder Abstract Categorial Grammars as Hyperedge Replacement Grammars Makoto Kanazawa National Institute of Informatics 2–1–2 Hitotsubashi, Chiyoda-ku, Tokyo, 101–8430, Japan A...
181
click to vote
ECOOP
2009
Springer
15 years 10 months ago
2009
Springer
We propose a novel approach based on coinductive logic to specify type systems of programming languages. The approach consists in encoding programs in Horn formulas which are inter...
VLSID
2006
IEEE
15 years 10 months ago
2006
IEEE
Many formal verification tools today are based on Boolean proof techniques. The two most powerful approaches in this context are Binary Decision Diagrams (BDDs) and methods based ...
LATA
2009
Springer
15 years 4 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
Group encryption (GE) schemes, introduced at Asiacrypt’07, are an encryption analogue of group signatures with a number of interesting applications. They allow a sender to encryp...