Sciweavers

1791 search results - page 20 / 359
» Two Types of Multiple-Conclusion Systems
Sort
View
TACS
2001
Springer
13 years 12 months ago
Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness
Abstract. We present two modal typing systems with the approximation modality, which has been proposed by the author to capture selfreferences involved in computer programs and the...
Hiroshi Nakano
TACAS
2010
Springer
151views Algorithms» more  TACAS 2010»
13 years 5 months ago
A Polymorphic Intermediate Verification Language: Design and Logical Encoding
Abstract. Intermediate languages are a paradigm to separate concerns in software verification systems when bridging the gap between programming languages and the logics understood ...
K. Rustan M. Leino, Philipp Rümmer
KBSE
2005
IEEE
14 years 1 months ago
Optimized run-time race detection and atomicity checking using partial discovered types
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. Two common kinds of concurrency errors are data races and atomicity violation...
Rahul Agarwal, Amit Sasturkar, Liqiang Wang, Scott...
TGC
2005
Springer
14 years 1 months ago
Types for Security in a Mobile World
Our society is increasingly moving towards richer forms of information exchange where mobility of processes and devices plays a prominent role. This tendency has prompted the acade...
Adriana B. Compagnoni, Elsa L. Gunter
ENTCS
2007
92views more  ENTCS 2007»
13 years 7 months ago
A Duality in Proof Systems for Recursive Type Equality and for Bisimulation Equivalence on Cyclic Term Graphs
This paper is concerned with a proof-theoretic observation about two kinds of proof systems for regular cyclic objects. It is presented for the case of two formal systems that are...
Clemens Grabmayer