INDUCTIVE COMPOSITION OF NUMBERS WITH MAXIMUM, MINIMUM, AND ADDITION: A New Theory for Program Execution-Time Analysis

DOI10.1142/S0129054104002790zbMath1136.68429OpenAlexW2093153050MaRDI QIDQ4652794

Farn Wang

Publication date: 28 February 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054104002790

zbMATH Keywords

concurrencyspecificationreal-timecontext-freesemilinear formsoftware recursion

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Uses Software

• Isabelle/HOL
• NQTHM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parametric timing analysis for real-time systems
• Model-checking in dense real-time
• The complexity of decision problems for finite-turn multicounter machines
• On certain formal properties of grammars
• Timing Parameter Characterization of Real-Time Systems
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• On circuits and numbers
• ON REACHABILITY AND SAFETY IN INFINITE-STATE SYSTEMS
• Mappings which preserve context sensitive languages

This page was built for publication: INDUCTIVE COMPOSITION OF NUMBERS WITH MAXIMUM, MINIMUM, AND ADDITION: A New Theory for Program Execution-Time Analysis