Sciweavers

197 search results - page 7 / 40
» Reduction Semantics and Formal Analysis of Orc Programs
Sort
View
FAC
2008
100views more  FAC 2008»
13 years 7 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
ISSTA
2009
ACM
14 years 2 months ago
A formal analysis of requirements-based testing
The aim of requirements-based testing is to generate test cases from a set of requirements for a given system or piece of software. In this paper we propose a formal semantics for...
Charles Pecheur, Franco Raimondi, Guillaume Brat
MEMOCODE
2003
IEEE
14 years 26 days ago
Optimizations for Faster Execution of Esterel Programs
Several efficient compilation techniques have been recently proposed for the generation of sequential (C) code from Esterel programs. Consisting essentially in direct simulation ...
Dumitru Potop-Butucaru, Robert de Simone
ESOP
2001
Springer
14 years 2 days ago
What Are Polymorphically-Typed Ambients?
The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code [CG98]. We consider an Ambient Calculus where ambients...
Torben Amtoft, A. J. Kfoury, Santiago M. Peric&aac...
JAR
2008
98views more  JAR 2008»
13 years 7 months ago
A Mechanical Analysis of Program Verification Strategies
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...
Sandip Ray, Warren A. Hunt Jr., John Matthews, J. ...