Sciweavers

4340 search results - page 388 / 868
» Formal Methods and Cryptography
Sort
View
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
15 years 4 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
ISOLA
2010
Springer
15 years 4 months ago
Modeling and Reasoning about Service Behaviors and Their Compositions
Abstract. Service-oriented systems have recently emerged as context-independent component-based systems. Unlike components, services can be created, invoked, composed, and destroye...
Aida Causevic, Cristina Cerschi Seceleanu, Paul Pe...
ACL
2009
15 years 4 months ago
Exploiting Heterogeneous Treebanks for Parsing
We address the issue of using heterogeneous treebanks for parsing by breaking it down into two sub-problems, converting grammar formalisms of the treebanks to the same one, and pa...
Zheng-Yu Niu, Haifeng Wang, Hua Wu
FORTE
2009
15 years 4 months ago
A Model-Checking Approach for Service Component Architectures
We present a strategy for model-checking the correctness of service composition. We do so in the context of SRML, a formal modelling framework for service-oriented computing being ...
João Abreu, Franco Mazzanti, José Lu...
SBMF
2010
Springer
129views Formal Methods» more  SBMF 2010»
15 years 1 months ago
Directed Model Checking for B: An Evaluation and New Techniques
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...
Michael Leuschel, Jens Bendisposto