Sciweavers

592 search results - page 104 / 119
» Can Component Service-Based Systems Be Proved Correct
Sort
View
COLING
2002
13 years 8 months ago
Creating a Finite-State Parser with Application Semantics
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...
BIRTHDAY
2004
Springer
14 years 2 months ago
A Trace Semantics for Long-Running Transactions
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
Michael J. Butler, C. A. R. Hoare, Carla Ferreira
EUROSYS
2008
ACM
14 years 5 months ago
BorderPatrol: isolating events for black-box tracing
Causal request traces are valuable to developers of large concurrent and distributed applications, yet difficult to obtain. Traces show how a request is processed, and can be anal...
Eric Koskinen, John Jannotti
ICSM
2007
IEEE
14 years 2 months ago
Indexing Noncrashing Failures: A Dynamic Program Slicing-Based Approach
Recent software systems usually feature an automated failure reporting component, with which a huge number of failures are collected from software end-users. With a proper support...
Xiangyu Zhang Chao Liu, Yu Zhang, Jiawei Han, Bhar...
HICSS
2007
IEEE
181views Biometrics» more  HICSS 2007»
14 years 2 months ago
A Methodology to Evaluate Agent Oriented Software Engineering Techniques
Systems using Software Agents (or Multi-Agent Systems, MAS) are becoming more popular within the development mainstream because, as the name suggests, an Agent aims to handle task...
Chia-En Lin, Krishna M. Kavi, Frederick T. Sheldon...