Sciweavers

153 search results - page 17 / 31
» Independence and Concurrent Separation Logic
Sort
View
CSL
2005
Springer
15 years 3 months ago
Feasible Proofs of Matrix Properties with Csanky's Algorithm
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
Michael Soltys
IPL
2010
95views more  IPL 2010»
14 years 8 months ago
Resource bisimilarity and graded bisimilarity coincide
Resource bisimilarity has been proposed in the literature on concurrency theory as a notion of bisimilarity over labeled transition systems that takes into account the number of c...
Luca Aceto, Anna Ingólfsdóttir, Josh...
COMPSAC
2006
IEEE
15 years 1 months ago
A Service-Oriented Design Framework for Secure Network Applications
Abstract---Service Oriented Architecture (SOA) is an architectural style to reuse and integrate existing systems for designing new applications. Each application is designed in an ...
Hiroshi Wada, Junichi Suzuki, Katsuya Oba
CONCUR
2009
Springer
15 years 4 months ago
Model-Checking Games for Fixpoint Logics with Partial Order Models
Abstract. We introduce model-checking games that allow local secondorder power on sets of independent transitions in the underlying partial order models where the games are played....
Julian Gutierrez, Julian C. Bradfield
RTSS
2007
IEEE
15 years 3 months ago
Adapting Futures: Scalability for Real-World Computing
Creating robust real-time embedded software is critical in combining the physical world with computing, such as in consumer electronics or robotics. One challenge is the complexit...
Johannes Helander, Risto Serg, Margus Veanes, Prit...