Sciweavers

Share
ICSE
2012
IEEE-ACM
6 years 9 months ago
Axis: Automatically fixing atomicity violations through solving control constraints
Abstract—Atomicity, a general correctness criterion in concurrency programs, is often violated in real-world applications. The violations are difficult for developers to fix, m...
Peng Liu, Charles Zhang
ESOP
2012
Springer
7 years 2 months ago
Complete Monitors for Behavioral Contracts
Abstract. A behavioral contract in a higher-order language may invoke methods of unknown objects. Although this expressive power allows programmers to formulate sophisticated contr...
Christos Dimoulas, Sam Tobin-Hochstadt, Matthias F...
CSL
2002
Springer
8 years 7 months ago
Open Proofs and Open Terms: A Basis for Interactive Logic
In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these ...
Herman Geuvers, Gueorgui I. Jojgov
PTS
1998
131views Hardware» more  PTS 1998»
8 years 8 months ago
Factorized Test Generation for Multi-Input/Output Transition Systems
In this paper we present factorized test generation techniques that can be used to generate test cases from a specification that is modelled as a labelled transition system. The t...
Ed Brinksma, Lex Heerink, Jan Tretmans
CAISE
2000
Springer
8 years 11 months ago
Temporally Faithful Execution of Business Transactions
Serializability is a prominent correctness criterion for an interleaved execution of concurrent transactions. Serializability guarantees that the interleaved execution of concurre...
Werner Obermair, Michael Schrefl
LPAR
2007
Springer
9 years 1 months ago
Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
Roberto Maieli
LICS
2008
IEEE
9 years 1 months ago
Correctness of Multiplicative Additive Proof Structures is NL-Complete
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NLcomple...
Paulin Jacobé de Naurois, Virgile Mogbil
books