Results 51 to 60 of about 24,416 (155)

Bounded model checking of multi-threaded c programs via lazy sequentialization

, 2014
Bounded model checking (BMC) has successfully been used for many practical program verification problems, but concurrency still poses a challenge. Here we describe a new approach to BMC of sequentially consistent C programs using POSIX threads.
Salvatore La Torre, Parlato, Gennaro, Fischer, Bernd, Tomasco, Ermenegildo, Omar Inverso, Parlato, G, La Torre, Salvatore, Ermenegildo Tomasco, Inverso, Omar, Gennaro Parlato, Bernd Fischer   +10 more
core   +1 more source

Logics of polyhedral reachability

CoRR
Polyhedral semantics is a recently introduced branch of spatial modal logic, in which modal formulas are interpreted as piecewise linear subsets of an Euclidean space. Polyhedral semantics for the basic modal language has already been well investigated.
Bezhanishvili N., Bussi L., Ciancia V., Fernandez-Duque D., Gabelaia D.   +4 more
openaire   +5 more sources

Reachability Logic [PDF]

, 2012
. This paper introduces *reachability logic*, a language-independent seven-rule proof system for deriving reachability properties of systems. The key ingredients of *reachability logic* are its sentences, which are called reachability rules and ...
Stefanescu, Andrei, Moore, Brandon, Ciobaca, Stefan, Rosu, Grigore   +3 more
core  

Multi-level Graph Compression for Fast Reachability Detection

, 2019
Fast reachability detection is one of the key problems in graph applications. Most of the existing works focus on creating an index and answering reachability based on that index.
Anirban, Shikha, Islam, Md Saiful, Md. Saiful Islam, Wang, Junhu, Shikha Anirban, Junhu Wang   +5 more
core   +1 more source

Reachability Predicates for Graph Assertions

, 2016
We introduce a logic-based formalism to specify updates on arbitrary graphs. For the resulting language called GLog, we introduce an assertional language for reasoning about infinite sets of graph configurations in which we use reachability predicates to
Delzanno, Giorgio, Giorgio Delzanno
core   +1 more source

A genetic methodology for reachability evaluation of manipulators

, 2004
In the process of manipulator design, reachability is an essential constrained condition. Because determining reachable position/orientation workspace is very difficult and reachability evaluation is very complicated. According to the concept of distance
Tan DL(谈大龙), Liu MY(刘明尧), Jianhua Wang   +2 more
core  

Reachability Analysis in BioAmbients

Electronic Notes in Theoretical Computer Science, 2009
AbstractWe rephrase results, previously proved by Busi and Zavattaro on Mobile Ambients, characterizing a fragment of BioAmbients –without restriction and merge– in which a generalized form of reachability turns out to be decidable.
openaire   +3 more sources

PVASS Reachability Is Decidable [PDF]

Reachability in pushdown vector addition systems with states (PVASS) is among the longest standing open problems in Theoretical Computer Science. We show that the problem is decidable in full generality. Our decision procedure is similar in spirit to the
Guttenberg, Roland, Keskin, Eren, Meyer, Roland   +2 more
core   +1 more source

Sequentializing parameterized programs

We exhibit assertion-preserving (reachability-preserving) transformations from parameterized concurrent shared-memory programs, under a k-round scheduling of processes, to sequential programs.
Parlato, Gennaro, La Torre, Salvatore, Madhusudan, P.   +2 more
core   +1 more source

Extro-Reachability Actualising New Digital Spaces for Academic Teaching Practice Continuity

The emergence of mobile technologies and their features has had a disruptive impact on every fabric of our daily activities. Due to their portability, ubiquity and pervasive connectivity, these artefacts have penetrated teaching and learning environments.
Ibokessien, Nyeneime
core   +1 more source