Sciweavers

47 search results - page 9 / 10
» Finitary Partial Inductive Definitions as a General Logic
Sort
View
ICFP
2005
ACM
14 years 5 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
POPL
2008
ACM
14 years 5 months ago
A theory of platform-dependent low-level software
The C language definition leaves the sizes and layouts of types partially unspecified. When a C program makes assumptions about type layout, its semantics is defined only on platf...
Marius Nita, Dan Grossman, Craig Chambers
POPL
2007
ACM
14 years 5 months ago
Lightweight fusion by fixed point promotion
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...
Atsushi Ohori, Isao Sasano
TSE
1998
129views more  TSE 1998»
13 years 5 months ago
Inferring Declarative Requirements Specifications from Operational Scenarios
—Scenarios are increasingly recognized as an effective means for eliciting, validating, and documenting software requirements. This paper concentrates on the use of scenarios for...
Axel van Lamsweerde, Laurent Willemet
POPL
2006
ACM
14 years 5 months ago
Specifying C++ concepts
C++ templates are key to the design of current successful mainstream libraries and systems. They are the basis of programming techniques in diverse areas ranging from conventional...
Gabriel Dos Reis, Bjarne Stroustrup