Sciweavers

622 search results - page 60 / 125
» Answer Set Programming and Bounded Model Checking
Sort
View
CAV
2010
Springer
179views Hardware» more  CAV 2010»
15 years 6 months ago
Generating Litmus Tests for Contrasting Memory Consistency Models
Well-defined memory consistency models are necessary for writing correct parallel software. Developing and understanding formal specifications of hardware memory models is a chal...
Sela Mador-Haim, Rajeev Alur, Milo M. K. Martin
138
Voted
RTSS
2008
IEEE
15 years 8 months ago
Symbolic Computation of Schedulability Regions Using Parametric Timed Automata
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...
Alessandro Cimatti, Luigi Palopoli, Yusi Ramadian
ICTAI
2010
IEEE
15 years 2 days ago
The BioASP Library: ASP Solutions for Systems Biology
Abstract--Today's molecular biology is confronted with enormous amounts of data, generated by new high-throughput technologies, along with an increasing number of biological m...
Martin Gebser, Arne König, Torsten Schaub, Sv...
FOCS
2009
IEEE
15 years 9 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
ILP
2007
Springer
15 years 8 months ago
Applying Inductive Logic Programming to Process Mining
The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows ...
Evelina Lamma, Paola Mello, Fabrizio Riguzzi, Serg...