Sciweavers

3239 search results - page 201 / 648
» A Logical Process Calculus
Sort
View
235
Voted
POPL
2007
ACM
16 years 3 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might
MFCS
2009
Springer
15 years 10 months ago
Synthesis for Structure Rewriting Systems
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
Lukasz Kaiser
126
Voted
FM
2001
Springer
130views Formal Methods» more  FM 2001»
15 years 8 months ago
Towards a Topos Theoretic Foundation for the Irish School of Constructive Mathematics
The Irish School of Constructive Mathematics (M♣ c ), which extends the VDM, exploits an algebraic notation based upon monoids and their morphisms for the purposes of abstract mo...
Mícheál Mac an Airchinnigh
136
Voted
CSL
1992
Springer
15 years 7 months ago
Communicating Evolving Algebras
We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...
Paola Glavan, Dean Rosenzweig
114
Voted
APAL
2010
98views more  APAL 2010»
15 years 3 months ago
Classical proof forestry
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
Willem Heijltjes