193 search results - page 31 / 39 » Automated Reasoning in Kleene Algebra |
131
click to vote
FROCOS
2009
Springer
15 years 6 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
LICS
2008
IEEE
15 years 6 months ago
2008
IEEE
We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for BCCSP modulo impossible...
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is ...
ICWL
2007
Springer
15 years 6 months ago
2007
Springer
AGILMAT is a web application designed to help students learn Mathematics, with focus on high-school algebra and calculus drills. A modular and extensible architecture and a wizard-...
TPHOL
2005
IEEE
15 years 5 months ago
2005
IEEE
Wouldn’t it be nice to be able to conveniently use ordinary real number expressions within proof assistants? In this paper we outline how this can be done within a theorem provin...