Sciweavers

2540 search results - page 322 / 508
» Abstract Logics as Dialgebras
Sort
View
FUIN
2007
135views more  FUIN 2007»
15 years 18 days ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner
110
Voted
WWW
2001
ACM
16 years 1 months ago
iMobile: An Agent-Based Platform for Mobile Services
iMobile is a platform that addresses the research issues in building mobile services. iMobile acts as a message gateway that allows mobile devices using various protocols on diffe...
Herman Chung-Hwa Rao, Yih-Farn Chen, Di-Fa Chang, ...
115
Voted
CADE
2007
Springer
16 years 29 days ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
158
Voted
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
15 years 9 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
123
Voted
KBSE
2005
IEEE
15 years 6 months ago
Prufrock: a framework for constructing polytypic theorem provers
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
Justin Ward, Garrin Kimmell, Perry Alexander