Sciweavers

50 search results - page 3 / 10
» Decidability and Complexity in Automatic Monoids
Sort
View
ICDT
2009
ACM
248views Database» more  ICDT 2009»
14 years 6 months ago
Automatic verification of data-centric business processes
We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". This approach focuses on data records, kn...
Alin Deutsch, Richard Hull, Fabio Patrizi, Victor ...
KBSE
2009
IEEE
14 years 15 days ago
Automatically Recommending Triage Decisions for Pragmatic Reuse Tasks
—Planning a complex software modification task imposes a high cognitive burden on developers, who must juggle navigating the software, understanding what they see with respect t...
Reid Holmes, Tristan Ratchford, Martin P. Robillar...
FUIN
2007
135views more  FUIN 2007»
13 years 5 months 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
IANDC
2007
151views more  IANDC 2007»
13 years 5 months ago
Transducer-based analysis of cryptographic protocols
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...
Ralf Küsters, Thomas Wilke
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 5 months ago
Verifying Recursive Active Documents with Positive Data Tree Rewriting
This paper considers a tree-rewriting framework for modeling documents evolving through service calls. We focus on the automatic verification of properties of documents that may c...
Blaise Genest, Anca Muscholl, Zhilin Wu