Sciweavers

12452 search results - page 2345 / 2491
» An exploration of program as language
Sort
View
ASWEC
2010
IEEE
14 years 10 months ago
Non-Monotonic Model Completion in Web Application Engineering
—Formal models are often used to verify systems and prove their correctness, and ensure that transformed models remain consistent to the original system. However, formal techniqu...
Jevon M. Wright, Jens Dietrich
CONCUR
2010
Springer
14 years 10 months ago
On the Compositionality of Round Abstraction
ompositionality of Round Abstraction Abstract Dan R. Ghica and Mohamed N. Menaa University of Birmingham, U.K. We revisit a technique called round abstraction as a solution to the ...
Dan R. Ghica, Mohamed N. Menaa
75
Voted
CORR
2008
Springer
137views Education» more  CORR 2008»
14 years 10 months ago
Combining generic judgments with recursive definitions
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Andrew Gacek, Dale Miller, Gopalan Nadathur
CORR
2008
Springer
103views Education» more  CORR 2008»
14 years 10 months ago
Executable Set Theory and Arithmetic Encodings in Prolog
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
Paul Tarau
ENTCS
2008
120views more  ENTCS 2008»
14 years 10 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
« Prev « First page 2345 / 2491 Last » Next »