Sciweavers

478 search results - page 55 / 96
» Formal Methods for Specifying, Validating, and Verifying Req...
Sort
View
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
14 years 5 months ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...
MSWIM
2006
ACM
14 years 2 months ago
Testing methodology for an ad hoc routing protocol
In this paper, we define a model of an ad hoc routing protocol, i.e. the OLSR (Optimized Link-State Routing) protocol. This model handles novel constraints related to such networ...
Stéphane Maag, Fatiha Zaïdi
COMPSAC
2002
IEEE
14 years 1 months ago
A Simple Mathematically Based Framework for Rule Extraction from an Arbitrary Programming Language
Programs use rules to dictate or constrain specific decisions or actions. These rules have typically been tested, revised, and updated continuously; therefore, they represent a su...
Frederick V. Ramsey, James J. Alpigini
BIRTHDAY
2003
Springer
14 years 1 months ago
Bounded Fairness
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
Nachum Dershowitz, D. N. Jayasimha, Seungjoon Park
ENTCS
2006
160views more  ENTCS 2006»
13 years 8 months ago
Checking and Correcting Behaviors of Java Programs at Runtime with Java-MOP
Monitoring-oriented programming (MOP) is a software development and analysis technique in which monitoring plays a fundamental role. MOP users can add their favorite or domain-spe...
Feng Chen, Marcelo d'Amorim, Grigore Rosu