Sciweavers

462 search results - page 82 / 93
» Symbolic Bounded Synthesis
Sort
View
114
Voted
COOPIS
2003
IEEE
15 years 7 months ago
Analysing Mailboxes of Asynchronous Communicating Components
Abstract. Asynchronous communications are prominent in distributed and mobile systems. Often consystems consider an abstract point of view with synchronous communications. However ...
Jean-Claude Royer, Michael Xu
FATES
2003
Springer
15 years 7 months ago
Auto-generating Test Sequences Using Model Checkers: A Case Study
Use of model-checking approaches for test generation from requirement models have been proposed by several researchers. These approaches leverage the witness (or counter-example) ...
Mats Per Erik Heimdahl, Sanjai Rayadurgam, Willem ...
GCSE
1999
Springer
15 years 6 months ago
Scoping Constructs for Software Generators
Abstract. A well-known problem in program generation is scoping. When identifiers (i.e., symbolic names) are used to refer to variables, types, or functions, program generators mu...
Yannis Smaragdakis, Don S. Batory
125
Voted
CP
1997
Springer
15 years 6 months ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...
CSFW
2010
IEEE
15 years 5 months ago
Modeling and Verifying Ad Hoc Routing Protocols
Mobile ad hoc networks consist of mobile wireless devices which autonomously organize their infrastructure. In such a network, a central issue, ensured by routing protocols, is to ...
Mathilde Arnaud, Véronique Cortier, St&eacu...