Sciweavers

547 search results - page 71 / 110
» On Automated Program Construction and Verification
Sort
View
80
Voted
POPL
2010
ACM
15 years 7 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
ERLANG
2007
ACM
15 years 1 months ago
A language for specifying type contracts in Erlang and its interaction with success typings
We propose a small extension of the ERLANG language that allows programmers to specify contracts with type information at the level of individual functions. Such contracts are opt...
Miguel Jimenez, Tobias Lindahl, Konstantinos F. Sa...
CAV
2010
Springer
197views Hardware» more  CAV 2010»
15 years 1 months ago
Abstract Analysis of Symbolic Executions
Analysis of Symbolic Executions Aws Albarghouthi1 , Arie Gurfinkel2 , Ou Wei1,3 , and Marsha Chechik1 1 Department of Computer Science, University of Toronto, Canada 2 Software Eng...
Aws Albarghouthi, Arie Gurfinkel, Ou Wei, Marsha C...
90
Voted
ENTCS
2008
118views more  ENTCS 2008»
14 years 9 months ago
Barbed Model-Driven Software Development: A Case Study
When thinking of MDE, the immediate understanding is that models drive software development, in the at the software is constructed by transforming models from higher levels of abs...
Carlo Montangero, Laura Semini
CORR
2004
Springer
107views Education» more  CORR 2004»
14 years 9 months ago
Encapsulation for Practical Simplification Procedures
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
Olga Shumsky Matlin, William McCune