Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
28
views
3
references
Top references
cited by
1
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
8,140
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Reachability Analysis of Procedural Programs with Affine Integer Arithmetic
other
Author(s):
Michael Luttenberger
Publication date
(Print):
2006
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Procedural speed in criminal law
Most cited references
3
Record
: found
Abstract
: not found
Book Chapter
: not found
On the Construction of Automata from Linear Arithmetic Constraints
Pierre Wolper
,
Bernard Boigelot
(2000)
0
comments
Cited
12
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis
Thomas Reps
,
Stefan Schwoon
,
Somesh Jha
(2003)
0
comments
Cited
7
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Reachability Analysis of Procedural Programs with Affine Integer Arithmetic
Michael Luttenberger
(2006)
0
comments
Cited
1
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2006
Pages
: 281-282
DOI:
10.1007/11812128_29
SO-VID:
506b1b4a-5a1a-421b-954b-79c6cce9f5e2
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Information Distance and Its Applications
pp. 10
Theory Inspired by Gene Assembly in Ciliates
pp. 11
On the State Complexity of Combined Operations
pp. 23
Path-Equivalent Removals of ε-transitions in a Genomic Weighted Finite Automaton
pp. 34
Hybrid Extended Finite Automata
pp. 46
Refinement of Near Random Access Video Coding with Weighted Finite Automata
pp. 58
Borders and Finite Automata
pp. 69
Finding Common Motifs with Gaps Using Finite Automata
pp. 78
Factor Oracles
pp. 90
Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice
pp. 102
Tiburon: A Weighted Tree Automata Toolkit
pp. 114
Around Hopcroft’s Algorithm
pp. 126
Multi-tape Automata with Symbol Classes
pp. 137
On the Computation of Some Standard Distances Between Probabilistic Automata
pp. 150
Does o-Substitution Preserve Recognizability?
pp. 162
Correctness Preservation and Complexity of Simple RL-Automata
pp. 173
Bisimulation Minimization of Tree Automata
pp. 186
Forgetting Automata and Unary Languages
pp. 198
Structurally Unambiguous Finite Automata
pp. 208
Symbolic Implementation of Alternating Automata
pp. 219
On-the-Fly Branching Bisimulation Minimization for Compositional Analysis
pp. 230
Finite-State Temporal Projection
pp. 242
Compiling Linguistic Constraints into Finite State Automata
pp. 253
Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time
pp. 265
A Family of Algorithms for Non Deterministic Regular Languages Inference
pp. 275
XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof
pp. 277
A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems
pp. 279
Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits
pp. 281
Reachability Analysis of Procedural Programs with Affine Integer Arithmetic
pp. 283
Lexical Disambiguation with Polarities and Automata
pp. 285
Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression
pp. 287
Tighter Packed Bit-Parallel NFA for Approximate String Matching
Similar content
8,140
The Prouhet-Tarry-Escott problem for Gaussian integers
Authors:
Timothy Caley
Integer quantum Hall transition in a fraction of a Landau level
Authors:
R. Bhatt
,
Scott D. Geraedts
,
Matteo Ippoliti
A functional MRI study of simple arithmetic--a comparison between children and adults.
Authors:
Kentaro Inoue
,
K Okita
,
Akihiro T. Sasaki
…
See all similar
Cited by
1
Reachability Analysis of Procedural Programs with Affine Integer Arithmetic
Authors:
Michael Luttenberger
See all cited by