Sciweavers

100 search results - page 20 / 20
» Linear-Time Model Checking: Automata Theory in Practice
Sort
View
ACL
2010
13 years 3 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
SIGSOFT
2009
ACM
14 years 2 days ago
Automatic synthesis of behavior protocols for composable web-services
Web-services are broadly considered as an effective means to achieve interoperability between heterogeneous parties of a business process and offer an open platform for developing...
Antonia Bertolino, Paola Inverardi, Patrizio Pelli...
APN
2007
Springer
13 years 11 months ago
ProM 4.0: Comprehensive Support for Real Process Analysis
This tool paper describes the functionality of ProM. Version 4.0 of ProM has been released at the end of 2006 and this version reflects recent achievements in process mining. Proc...
Wil M. P. van der Aalst, Boudewijn F. van Dongen, ...
PASTE
2005
ACM
13 years 10 months ago
Generalizing symbolic execution to library classes
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
Sarfraz Khurshid, Yuk Lai Suen
AGTIVE
2003
Springer
13 years 10 months ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman