Sciweavers

1750 search results - page 226 / 350
» Formal multiple-bernoulli models for language modeling
Sort
View
COORDINATION
2006
Springer
15 years 1 months ago
Formalising Business Process Execution with Bigraphs and Reactive XML
Bigraphical Reactive Systems have been proposed as a meta model for global ubiquitous computing generalising process calculi for mobility such as the pi-calculus and the Mobile Amb...
Thomas T. Hildebrandt, Henning Niss, Martin Olsen
POPL
2010
ACM
15 years 7 months ago
Verified just-in-time compiler on x86
This paper presents a method for creating formally correct just-intime (JIT) compilers. The tractability of our approach is demonstrated through, what we believe is the first, ver...
Magnus O. Myreen
KCAP
2005
ACM
15 years 3 months ago
OLA in the OAEI 2005 Alignment Contest
Among the variety of alignment approaches (e.g., using machine learning, subsumption computation, formal concept analysis, etc.) similarity-based ones rely on a quantitative asses...
Jérôme Euzenat, Philippe Guéga...
FM
2005
Springer
99views Formal Methods» more  FM 2005»
15 years 3 months ago
Semantics of BPEL4WS-Like Fault and Compensation Handling
BPEL4WS is one of the most important business process modelling languages. One distinct feature of it is the fully programmable fault and compensation handling mechanism, which all...
Zongyan Qiu, Shuling Wang, Geguang Pu, Xiangpeng Z...
FM
2008
Springer
93views Formal Methods» more  FM 2008»
14 years 11 months ago
Finding Minimal Unsatisfiable Cores of Declarative Specifications
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
Emina Torlak, Felix Sheng-Ho Chang, Daniel Jackson