Sciweavers

202 search results - page 39 / 41
» Compiler implementation in a formal logical framework
Sort
View
POPL
2012
ACM
12 years 3 months ago
Programming with binders and indexed data-types
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
Andrew Cave, Brigitte Pientka
CADE
2007
Springer
14 years 7 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
SIGCSE
2005
ACM
163views Education» more  SIGCSE 2005»
14 years 1 months ago
Using SeSFJava in teaching introductory network courses
Networking course projects are usually described by an informal specification and a collection of test cases. Students often misunderstand the specification or oversimplify it t...
Tamer Elsharnouby, A. Udaya Shankar
POPL
2007
ACM
14 years 7 months ago
Modular type classes
ML modules and Haskell type classes have proven to be highly effective tools for program structuring. Modules emphasize explicit configuration of program components and the use of...
Derek Dreyer, Robert Harper, Manuel M. T. Chakrava...
ICTAC
2009
Springer
13 years 5 months ago
Integration Testing from Structured First-Order Specifications via Deduction Modulo
Testing from first-order specifications has mainly been studied for flat specifications, that are specifications of a single software module. However, the specifications of large s...
Delphine Longuet, Marc Aiguier