Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Finding recurrent sets with backward analysis and trace partitioning

From MaRDI portal
Publication:2272913
Jump to:navigation, search

DOI10.1007/978-3-662-49674-9_2zbMath1420.68063OpenAlexW2337307448MaRDI QIDQ2272913

Alexey Bakhirkin, Nir Piterman

Publication date: 17 September 2019

Full work available at URL: https://link.springer.com/chapter/10.1007/978-3-662-49674-9_2



Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)


Related Items (1)

Proving Termination Through Conditional Termination






This page was built for publication: Finding recurrent sets with backward analysis and trace partitioning

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2272913&oldid=14835743"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 2 February 2024, at 10:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki