Sciweavers

2076 search results - page 259 / 416
» Functional logic overloading
Sort
View
142
Voted
ICFP
2008
ACM
16 years 3 months 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...
127
Voted
POPL
2010
ACM
16 years 20 days ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
CCS
2007
ACM
15 years 9 months ago
A simple and expressive semantic framework for policy composition in access control
In defining large, complex access control policies, one would like to compose sub-policies, perhaps authored by different organizations, into a single global policy. Existing po...
Glenn Bruns, Daniel S. Dantas, Michael Huth
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 7 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
FMCAD
2006
Springer
15 years 7 months ago
An Integration of HOL and ACL2
We describe a link between the ACL2 and HOL mechanical proof assistants that enables the strengths of each system to be deployed smoothly within a single formal development. Severa...
Michael J. C. Gordon, James Reynolds, Warren A. Hu...