Sciweavers

FORTE
2008
14 years 29 days ago
Checking Correctness of Transactional Behaviors
Abstract. The Signal Calculus is an asynchronous process calculus featuring multicast communication. It relies on explicit modeling of the communication structure of the network (c...
Vincenzo Ciancia, Gian Luigi Ferrari, Roberto Guan...
FORTE
2008
14 years 29 days ago
Parameterized Tree Systems
Abstract. Several recent works have considered parameterized verification, i.e. automatic verification of systems consisting of an arbitrary number of finite-state processes organi...
Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio De...
FORTE
2008
14 years 29 days ago
Model Generation for Horn Logic with Stratified Negation
Abstract. Model generation is an important formal technique for finding interesting instances of computationally hard problems. In this paper we study model generation over Horn lo...
Ethan K. Jackson, Wolfram Schulte
FORTE
2008
14 years 29 days ago
Detecting Communication Protocol Security Flaws by Formal Fuzz Testing and Machine Learning
Network-based fuzz testing has become an effective mechanism to ensure the security and reliability of communication protocol systems. However, fuzz testing is still conducted in a...
Guoqiang Shu, Yating Hsu, David Lee
FORTE
2008
14 years 29 days ago
Distributed Semantics and Implementation for Systems with Interaction and Priority
The paper studies a distributed implementation method for the BIP (Behavior, Interaction, Priority) component framework for modeling heterogeneous systems. BIP offers two powerful ...
Ananda Basu, Philippe Bidinger, Marius Bozga, Jose...
FORTE
2008
14 years 29 days ago
Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations
Abstract. Our concrete objective is to present both ordinary bisimulations and probabilistic bisimulations in a common coalgebraic framework based on multiset bisimulations. For th...
David de Frutos-Escrig, Miguel Palomino, Ignacio F...
FORTE
2008
14 years 29 days ago
Program Repair Suggestions from Graphical State-Transition Specifications
In software engineering, graphical formalisms, like state-transition tables and automata, are very often indispensable parts of the specifications. Such a formalism usually leads t...
Farn Wang, Chih-Hong Cheng
FORTE
2008
14 years 29 days ago
An SMT Approach to Bounded Reachability Analysis of Model Programs
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
Margus Veanes, Nikolaj Bjørner, Alexander R...
FMOODS
2008
14 years 29 days ago
VeriCool: An Automatic Verifier for a Concurrent Object-Oriented Language
Reasoning about object-oriented programs is hard, due to , dynamic binding and the need for data abstraction and framing. Reasoning about concurrent object-oriented programs is eve...
Jan Smans, Bart Jacobs 0002, Frank Piessens
FMOODS
2008
14 years 29 days ago
Semantic Foundations and Inference of Non-null Annotations
This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a mini...
Laurent Hubert, Thomas P. Jensen, David Pichardie