Sciweavers

BIRTHDAY
2006
Springer
13 years 11 months ago
Grammar Analysis and Parsing by Abstract Interpretation
Patrick Cousot, Radhia Cousot
BIRTHDAY
2006
Springer
13 years 11 months ago
Abstract Counterexample-Based Refinement for Powerset Domains
Roman Manevich, John Field, Thomas A. Henzinger, G...
BIRTHDAY
2006
Springer
13 years 11 months ago
Realistic Worst-Case Execution Time Analysis in the Context of Pervasive System Verification
We describe a gate level design of a FlexRay-like bus interface. An electronic control unit (ECU) is obtained by integrating this interface into the design of the verified VAMP pro...
Steffen Knapp, Wolfgang J. Paul
BIRTHDAY
2006
Springer
13 years 11 months ago
Refinement-Based Verification for Possibly-Cyclic Lists
In earlier work, we presented an abstraction-refinement mechanism that was successful in verifying automatically the partial correctness of in-situ list reversal when applied to an...
Alexey Loginov, Thomas W. Reps, Mooly Sagiv
BIRTHDAY
2006
Springer
13 years 11 months ago
Composition by Colimit and Formal Software Development
Abstract. Goguen emphasized long ago that colimits are how to compose systems [7]. This paper corroborates and elaborates Goguen's vision by presenting a variety of situations...
Douglas R. Smith
BIRTHDAY
2006
Springer
13 years 11 months ago
Horizontal Composability Revisited
We recall the contribution of Goguen and Burstall's 1980 CAT paper and its powerful influence on theories of specification implementation that were emerging at about the same ...
Donald Sannella, Andrzej Tarlecki
BIRTHDAY
2006
Springer
13 years 11 months ago
Complete Categorical Deduction for Satisfaction as Injectivity
Birkhoff (quasi-)variety categorical axiomatizability results have fascinated many scientists by their elegance, simplicity and generality. The key factor leading to their generali...
Grigore Rosu
BIRTHDAY
2006
Springer
13 years 11 months ago
Some Varieties of Equational Logic
d Abstract) Gordon Plotkin1, LFCS, School of Informatics, University of Edinburgh, UK. The application of ideas from universal algebra to computer science has long been a major the...
Gordon D. Plotkin
BIRTHDAY
2006
Springer
13 years 11 months ago
Some Tips on Writing Proof Scores in the OTS/CafeOBJ Method
Kazuhiro Ogata, Kokichi Futatsugi
BIRTHDAY
2006
Springer
13 years 11 months ago
A Stochastic Theory of Black-Box Software Testing
Abstract. We introduce a mathematical framework for black-box software testing of functional correctness, based on concepts from stochastic process theory. This framework supports ...
Karl Meinke