Sciweavers

2291 search results - page 252 / 459
» Representational Reasoning and Verification
Sort
View
ICFP
2008
ACM
16 years 18 days ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
123
Voted
ICFP
2005
ACM
16 years 18 days 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...
PEPM
2010
ACM
15 years 2 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...
116
Voted
CSL
2010
Springer
15 years 1 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter
JAR
2000
145views more  JAR 2000»
15 years 13 days ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro