154 search results - page 27 / 31 » Proof Complexity of Non-classical Logics |
155
Voted
VMCAI
2004
Springer
15 years 9 months ago
2004
Springer
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
143
Voted
MEMOCODE
2010
IEEE
15 years 1 months ago
2010
IEEE
Electronic System Level (ESL) design manages the complexity of todays systems by using abstract models. In this context Transaction Level Modeling (TLM) is state-of-theart for desc...
143
Voted
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
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...
131
Voted
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
133
Voted
ICFP
2010
ACM
15 years 4 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...