Sciweavers

50 search results - page 10 / 10
» Strictly Level-Decreasing Logic Programs
Sort
View
WWW
2008
ACM
14 years 5 months ago
Extending the compatibility notion for abstract WS-BPEL processes
WS-BPEL Processes Dieter K?nig IBM B?blingen Laboratory Sch?naicher Stra?e 220, 71032 B?blingen, Germany dieterkoenig@de.ibm.com Niels Lohmann Universit?t Rostock, Institut f?r Inf...
Dieter König, Niels Lohmann, Simon Moser, Chr...
SCAM
2008
IEEE
13 years 11 months ago
CoordInspector: A Tool for Extracting Coordination Data from Legacy Code
—More and more current software systems rely on non trivial coordination logic for combining autonomous services typically running on different platforms and often owned by diffe...
Nuno F. Rodrigues, Luís Soares Barbosa
ICALP
1998
Springer
13 years 9 months ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr
MICRO
2006
IEEE
84views Hardware» more  MICRO 2006»
13 years 10 months ago
Reunion: Complexity-Effective Multicore Redundancy
To protect processor logic from soft errors, multicore redundant architectures execute two copies of a program on separate cores of a chip multiprocessor (CMP). Maintaining identi...
Jared C. Smolens, Brian T. Gold, Babak Falsafi, Ja...
BMCBI
2006
127views more  BMCBI 2006»
13 years 4 months ago
Automatic discovery of cross-family sequence features associated with protein function
Background: Methods for predicting protein function directly from amino acid sequences are useful tools in the study of uncharacterised protein families and in comparative genomic...
Markus Brameier, Josien Haan, Andrea Krings, Rober...