A unifying approach to data-independence

DOI10.1007/3-540-44618-4_41MaRDI QIDQ4536630zbMATH OpenFDO

Authors Ranko Lazić, David Nowak

Publication date 28 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44618-4_41

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 2061713
• A semantic condition for data independence and applications in hardware verification
• On model checking data-independent systems with arrays without reset
• scientific article; zbMATH DE number 1418468
• scientific article; zbMATH DE number 4123275

Cited in

(11)

• Unification: A case-study in data refinement
• A semantic condition for data independence and applications in hardware verification
• scientific article; zbMATH DE number 3854400 (Why is no real title available?)
• scientific article; zbMATH DE number 2061713 (Why is no real title available?)
• On model checking data-independent systems with arrays without reset
• Program verification using symbolic game semantics
• A succinct canonical register automaton model
• Register-bounded synthesis
• Church synthesis on register automata over linearly ordered data domains
• Church synthesis on register automata over linearly ordered data domains
• Preserving data utility via BART

This page was built for publication: A unifying approach to data-independence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536630)