Search

Your search keyword '"reachability problem"' showing total 1,499 results
Start Over Descriptor "reachability problem"

Refine your results

more »

more »

more »
1,499 results on '"reachability problem"'

201. Context-Bounded Analysis of Concurrent Queue Systems

Author

La Torre, Salvatore, Madhusudan, P., Parlato, Gennaro, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Ramakrishnan, C. R., editor, and Rehof, Jakob, editor

Published
2008
Full Text
View/download PDF

202. SDSIrep: A Reputation System Based on SDSI

Author

Bouajjani, Ahmed, Esparza, Javier, Schwoon, Stefan, Suwimonteerabuth, Dejvuth, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Ramakrishnan, C. R., editor, and Rehof, Jakob, editor

Published
2008
Full Text
View/download PDF

203. The ω-Regular Post Embedding Problem

Author

Chambart, P., Schnoebelen, Ph., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Amadio, Roberto, editor

Published
2008
Full Text
View/download PDF

204. Periodic and Infinite Traces in Matrix Semigroups

Author

Bell, Paul, Potapov, Igor, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Geffert, Viliam, editor, Karhumäki, Juhani, editor, Bertoni, Alberto, editor, Preneel, Bart, editor, Návrat, Pavol, editor, and Bieliková, Mária, editor

Published
2008
Full Text
View/download PDF

205. The Reachability Problem for Two-Dimensional Vector Addition Systems with States

Author

MckenziePierre, LazićRanko, EnglertMatthias, HaaseChristoph, FinkelAlain, TotzkePatrick, BlondinMichael, and GÖllerStefan

Subjects
Discrete mathematics, Vector addition, Unary operation, Computer science, Reachability problem, 020207 software engineering, 0102 computer and information sciences, 02 engineering and technology, Petri net, 01 natural sciences, QA76, 010201 computation theory & mathematics, Artificial Intelligence, Hardware and Architecture, Control and Systems Engineering, Reachability, Computer Science::Logic in Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Computer Science::Formal Languages and Automata Theory, Software, Information Systems
Abstract

We prove that the reachability problem for two-dimensional vector addition systems with states is NL-complete or PSPACE-complete, depending on whether the numbers in the input are encoded in unary or binary. As a key underlying technical result, we show that, if a configuration is reachable, then there exists a witnessing path whose sequence of transitions is contained in a bounded language defined by a regular expression of pseudo-polynomially bounded length. This, in turn, enables us to prove that the lengths of minimal reachability witnesses are pseudo-polynomially bounded.

Published
2021
Full Text
View/download PDF

206. Eagle

Author

Jingbo Lu, Dongjie He, and Jingling Xue

Subjects
Theoretical computer science, Computer science, Reachability problem, 020207 software engineering, Context (language use), 02 engineering and technology, Call graph, Taint checking, Reachability, 020204 information systems, Pointer (computer programming), 0202 electrical engineering, electronic engineering, information engineering, Pointer analysis, Software, Combinatorial explosion
Abstract

Object sensitivity is widely used as a context abstraction for computing the points-to information context-sensitively for object-oriented programming languages such as Java. Due to the combinatorial explosion of contexts in large object-oriented programs, k -object-sensitive pointer analysis (under k -limiting), denoted k -obj , is often inefficient even when it is scalable for small values of k , where k ⩽ 2 holds typically. A recent popular approach for accelerating k -obj trades precision for efficiency by instructing k -obj to analyze only some methods in a program context-sensitively, determined heuristically by a pre-analysis. In this article, we investigate how to develop a fundamentally different approach, Eagle , for designing a pre-analysis that can make k -obj run significantly faster while maintaining its precision. The novelty of Eagle is to enable k -obj to analyze a method with partial context sensitivity (i.e., context-sensitively for only some of its selected variables/allocation sites) by solving a context-free-language (CFL) reachability problem based on a new CFL-reachability formulation of k -obj . By regularizing one CFL for specifying field accesses and using another CFL for specifying method calls, we have formulated Eagle as a fully context-sensitive taint analysis (without k -limiting) that is both effective (by selecting the variables/allocation sites to be analyzed by k -obj context-insensitively so as to reduce the number of context-sensitive facts inferred by k -obj in the program) and efficient (by running linearly in terms of the number of pointer assignment edges in the program). As Eagle represents the first precision-preserving pre-analysis, our evaluation focuses on demonstrating its significant performance benefits in accelerating k -obj for a set of popular Java benchmarks and applications, with call graph construction, may-fail-casting, and polymorphic call detection as three important client analyses.

Published
2021
Full Text
View/download PDF

207. Specification-Guided Verification and Abstraction Refinement of Mixed Monotone Stochastic Systems

Author

Maxence Dutreix and Samuel Coogan

Subjects
Signal Processing (eess.SP), 0209 industrial biotechnology, Theoretical computer science, Markov chain, Reachability problem, Computer science, Markov process, 02 engineering and technology, Interval (mathematics), Cartesian product, Computer Science Applications, symbols.namesake, 020901 industrial engineering & automation, Monotone polygon, Linear temporal logic, Control and Systems Engineering, FOS: Electrical engineering, electronic engineering, information engineering, symbols, State space, Electrical Engineering and Systems Science - Signal Processing, Electrical and Electronic Engineering
Abstract

This paper addresses the problem of verifying discrete-time stochastic systems against omega-regular specifications using finite-state abstractions. Omega-regular properties allow specifying complex behavior and encompass, for example, linear temporal logic. We focus on a class of systems with mixed monotone dynamics. This class has recently been show to be amenable to efficient reachable set computation and models a wide-range of physically relevant systems. In general, finite-state abstractions of continuous state stochastic systems give rise to augmented Markov Chains wherein the probabilities of transition between states are restricted to an interval. We present a procedure to compute a finite-state Interval-valued Markov Chain abstraction of discrete-time, mixed monotone stochastic systems subject to affine disturbances given a rectangular partition of the state-space. Then, we suggest an algorithm for performing verification against omega-regular properties in IMCs. Specifically, we aim to compute bounds on the probability of satisfying the specification of interest from any initial state in the IMC. This is achieved by solving a reachability problem on sets of so-called winning and losing components in the Cartesian product between the IMC and a Rabin automaton representing the specification. Next, the verification of IMCs may yield a set of states whose acceptance status is undecided with respect to the specification, requiring a refinement of the abstraction. We describe a specification-guided approach that compares the best-case and worst-case behaviors of accepting paths in the IMC and targets the appropriate states accordingly. Finally, we show a case study.

Published
2021
Full Text
View/download PDF

208. Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs

Author

David Auger and Pierre Coucheney and Loric Duhazé, Auger, David, Coucheney, Pierre, Duhazé, Loric, David Auger and Pierre Coucheney and Loric Duhazé, Auger, David, Coucheney, Pierre, and Duhazé, Loric

Abstract

A rotor walk in a directed graph can be thought of as a deterministic version of a Markov Chain, where a pebble moves from vertex to vertex following a simple rule until a terminal vertex, or sink, has been reached. The ARRIVAL problem, as defined by Dohrau et al. [Dohrau et al., 2017], consists in determining which sink will be reached. While the walk itself can take an exponential number of steps, this problem belongs to the complexity class NP ∩ co-NP without being known to be in P. In this work, we define a class of directed graphs, namely tree-like multigraphs, which are multigraphs having the global shape of an undirected tree. We prove that in this class, ARRIVAL can be solved in almost linear time, while the number of steps of a rotor walk can still be exponential. Then, we give an application of this result to solve some deterministic analogs of stochastic models (e.g., Markovian decision processes, Stochastic Games).

Published
2022
Full Text
View/download PDF

209. Involved VASS Zoo (Invited Talk)

Author

Wojciech Czerwiński, Czerwiński, Wojciech, Wojciech Czerwiński, and Czerwiński, Wojciech

Abstract

We briefly describe recent advances on understanding the complexity of the reachability problem for vector addition systems (or equivalently for vector addition systems with states - VASSes). We present a zoo of a few involved VASS examples, which illustrate various aspects of hardness of VASSes and various techniques of proving lower complexity bounds.

Published
2022
Full Text
View/download PDF

210. Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem

Author

Sławomir Lasota, Lasota, Sławomir, Sławomir Lasota, and Lasota, Sławomir

Abstract

Petri nets, equivalently presentable as vector addition systems with states, are an established model of concurrency with widespread applications. The reachability problem, where we ask whether from a given initial configuration there exists a sequence of valid execution steps reaching a given final configuration, is the central algorithmic problem for this model. The complexity of the problem has remained, until recently, one of the hardest open questions in verification of concurrent systems. A first upper bound has been provided only in 2015 by Leroux and Schmitz, then refined by the same authors to non-primitive recursive Ackermannian upper bound in 2019. The exponential space lower bound, shown by Lipton already in 1976, remained the only known for over 40 years until a breakthrough non-elementary lower bound by Czerwiński, Lasota, Lazic, Leroux and Mazowiecki in 2019. Finally, a matching Ackermannian lower bound announced this year by Czerwiński and Orlikowski, and independently by Leroux, established the complexity of the problem. Our primary contribution is an improvement of the former construction, making it conceptually simpler and more direct. On the way we improve the lower bound for vector addition systems with states in fixed dimension (or, equivalently, Petri nets with fixed number of places): while Czerwiński and Orlikowski prove F_k-hardness (hardness for kth level in Grzegorczyk Hierarchy) in dimension 6k, our simplified construction yields F_k-hardness already in dimension 3k+2.

Published
2022
Full Text
View/download PDF

211. Study of Limits of Solvability in Tag Systems

Author

De Mol, Liesbeth, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Durand-Lose, Jérôme, editor, and Margenstern, Maurice, editor

Published
2007
Full Text
View/download PDF

212. Reachability Problems in Quaternion Matrix and Rotation Semigroups

Author

Bell, Paul, Potapov, Igor, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Kučera, Luděk, editor, and Kučera, Antonín, editor

Published
2007
Full Text
View/download PDF

213. On the Complexity of Kings

Author

Hemaspaandra, Edith, Hemaspaandra, Lane A., Tantau, Till, Watanabe, Osamu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Csuhaj-Varjú, Erzsébet, editor, and Ésik, Zoltán, editor

Published
2007
Full Text
View/download PDF

214. Rewriting Systems with Data : A Framework for Reasoning About Systems with Unbounded Structures over Infinite Data Domains

Author

Bouajjani, Ahmed, Habermehl, Peter, Jurski, Yan, Sighireanu, Mihaela, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Csuhaj-Varjú, Erzsébet, editor, and Ésik, Zoltán, editor

Published
2007
Full Text
View/download PDF

217. Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing

Author

Yang, Linmin, Dang, Zhe, Ibarra, Oscar H., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Akl, Selim G., editor, Calude, Cristian S., editor, Dinneen, Michael J., editor, Rozenberg, Grzegorz, editor, and Wareham, H. Todd, editor

Published
2007
Full Text
View/download PDF

218. Translating Time-Course Gene Expression Profiles into Semi-algebraic Hybrid Automata Via Dimensionality Reduction

Author

Casagrande, Alberto, Casey, Kevin, Falchi, Rachele, Piazza, Carla, Ruperti, Benedetto, Vizzotto, Giannina, Mishra, Bud, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Anai, Hirokazu, editor, Horimoto, Katsuhisa, editor, and Kutsia, Temur, editor

Published
2007
Full Text
View/download PDF

219. Minimum-Time Reachability in Timed Games

Author

Brihaye, Thomas, Henzinger, Thomas A., Prabhu, Vinayak S., Raskin, Jean-François, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Arge, Lars, editor, Cachin, Christian, editor, Jurdziński, Tomasz, editor, and Tarlecki, Andrzej, editor

Published
2007
Full Text
View/download PDF

220. Reachability-Time Games on Timed Automata : (Extended Abstract)

Author

Jurdziński, Marcin, Trivedi, Ashutosh, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Arge, Lars, editor, Cachin, Christian, editor, Jurdziński, Tomasz, editor, and Tarlecki, Andrzej, editor

Published
2007
Full Text
View/download PDF

221. Comparison of the Expressiveness of Arc, Place and Transition Time Petri Nets

Author

Boyer, M., Roux, O. H., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Kleijn, Jetty, editor, and Yakovlev, Alex, editor

Published
2007
Full Text
View/download PDF

222. Composing Semi-algebraic O-Minimal Automata

Author

Casagrande, A., Corvaja, P., Piazza, C., Mishra, B., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bemporad, Alberto, editor, Bicchi, Antonio, editor, and Buttazzo, Giorgio, editor

Published
2007
Full Text
View/download PDF

223. MARCO: A Reachability Algorithm for Multi-affine Systems with Applications to Biological Systems

Author

Berman, Spring, Halász, Ádám, Kumar, Vijay, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bemporad, Alberto, editor, Bicchi, Antonio, editor, and Buttazzo, Giorgio, editor

Published
2007
Full Text
View/download PDF

224. Groupoids in Control Systems and the Reachability Problem for a Class of Quantized Control Systems with Nonabelian Symmetries

Author

Arsie, Alessandro, Frazzoli, Emilio, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bemporad, Alberto, editor, Bicchi, Antonio, editor, and Buttazzo, Giorgio, editor

Published
2007
Full Text
View/download PDF

225. Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems

Author

Hague, Matthew, Ong, C. -H. Luke, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Seidl, Helmut, editor

Published
2007
Full Text
View/download PDF

226. Causal Dataflow Analysis for Concurrent Programs

Author

Farzan, Azadeh, Madhusudan, P., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Grumberg, Orna, editor, and Huth, Michael, editor

Published
2007
Full Text
View/download PDF

227. On Flat Programs with Lists

Author

Bozga, Marius, Iosif, Radu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Cook, Byron, editor, and Podelski, Andreas, editor

Published
2007
Full Text
View/download PDF

228. Model-Checking Large Finite-State Systems and Beyond

Author

Brim, Luboš, Křetínský, Mojmír, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, van Leeuwen, Jan, editor, Italiano, Giuseppe F., editor, van der Hoek, Wiebe, editor, Meinel, Christoph, editor, Sack, Harald, editor, and Plášil, František, editor

Published
2007
Full Text
View/download PDF

229. On the Reachability Problem in P Systems with Mobile Membranes

Author

Aman, Bogdan, Ciobanu, Gabriel, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Eleftherakis, George, editor, Kefalas, Petros, editor, Păun, Gheorghe, editor, Rozenberg, Grzegorz, editor, and Salomaa, Arto, editor

Published
2007
Full Text
View/download PDF

230. On the Dynamics of PB Systems with Volatile Membranes

Author

Delzanno, Giorgio, Van Begin, Laurent, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Eleftherakis, George, editor, Kefalas, Petros, editor, Păun, Gheorghe, editor, Rozenberg, Grzegorz, editor, and Salomaa, Arto, editor

Published
2007
Full Text
View/download PDF

231. Program Analysis Using Weighted Pushdown Systems

Author

Reps, Thomas, Lal, Akash, Kidd, Nick, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Arvind, V., editor, and Prasad, Sanjiva, editor

Published
2007
Full Text
View/download PDF

232. Reasoning over Extended ER Models

Author

Artale, A., Calvanese, D., Kontchakov, R., Ryzhikov, V., Zakharyaschev, M., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Parent, Christine, editor, Schewe, Klaus-Dieter, editor, Storey, Veda C., editor, and Thalheim, Bernhard, editor

Published
2007
Full Text
View/download PDF

233. Dynamical Properties of Timed Automata Revisited

Author

Dima, Cătălin, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Raskin, Jean-François, editor, and Thiagarajan, P. S., editor

Published
2007
Full Text
View/download PDF

234. Distributed Time-Asynchronous Automata

Author

Dima, Cătălin, Lanotte, Ruggero, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Jones, Cliff B., editor, Liu, Zhiming, editor, and Woodcock, Jim, editor

Published
2007
Full Text
View/download PDF

235. Unlocking Keys for XML Trees

Author

Hartmann, Sven, Link, Sebastian, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Schwentick, Thomas, editor, and Suciu, Dan, editor

Published
2006
Full Text
View/download PDF

237. Heuristic Search for the Analysis of Graph Transition Systems

Author

Edelkamp, Stefan, Jabbar, Shahid, Lafuente, Alberto Lluch, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Corradini, Andrea, editor, Ehrig, Hartmut, editor, Montanari, Ugo, editor, Ribeiro, Leila, editor, and Rozenberg, Grzegorz, editor

Published
2006
Full Text
View/download PDF

238. Model Checking Multithreaded Programs with Asynchronous Atomic Methods

Author

Sen, Koushik, Viswanathan, Mahesh, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Ball, Thomas, editor, and Jones, Robert B., editor

Published
2006
Full Text
View/download PDF

239. Computationally Equivalent Elimination of Conditions

Author

Şerbănuţă, Traian Florin, Roşu, Grigore, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Pfenning, Frank, editor

Published
2006
Full Text
View/download PDF

240. Turing Universality in Dynamical Systems

Author

Delvenne, Jean-Charles, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Dough, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Beckmann, Arnold, editor, Berger, Ulrich, editor, Löwe, Benedikt, editor, and Tucker, John V., editor

Published
2006
Full Text
View/download PDF

241. Reachability Analysis of Multi-affine Systems

Author

Kloetzer, Marius, Belta, Calin, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Dough, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Hespanha, João P., editor, and Tiwari, Ashish, editor

Published
2006
Full Text
View/download PDF

242. Decision Problems for the Verification of Real-Time Software

Author

Emmi, Michael, Majumdar, Rupak, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Dough, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Hespanha, João P., editor, and Tiwari, Ashish, editor

Published
2006
Full Text
View/download PDF

246. On Sampled Semantics of Timed Systems

Author

Krčál, Pavel, Pelánek, Radek, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Sarukkai, Sundar, editor, and Sen, Sandeep, editor

Published
2005
Full Text
View/download PDF

247. The Directed Planar Reachability Problem

Author

Allender, Eric, Datta, Samir, Roy, Sambuddha, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Sarukkai, Sundar, editor, and Sen, Sandeep, editor

Published
2005
Full Text
View/download PDF

248. Natural Narrowing for General Term Rewriting Systems

Author

Escobar, Santiago, Meseguer, José, Thati, Prasanna, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Giesl, Jürgen, editor

Published
2005
Full Text
View/download PDF

249. Computation in One-Dimensional Piecewise Maps and Planar Pseudo-Billiard Systems

Author

Kurganskyy, Oleksiy, Potapov, Igor, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Calude, Cristian S., editor, Dinneen, Michael J., editor, Păun, Gheorghe, editor, Pérez-Jímenez, Mario J., editor, and Rozenberg, Grzegorz, editor

Published
2005
Full Text
View/download PDF

250. Deciding Reachability in Mobile Ambients

Author

Busi, Nadia, Zavattaro, Gianluigi, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Sagiv, Mooly, editor

Published
2005
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results