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

Assertion-based slicing and slice graphs

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

DOI10.1007/s00165-011-0196-1zbMath1259.68119OpenAlexW2048193923MaRDI QIDQ1941855

José Bernardo Barros, Jorge Sousa Pinto, Daniela da Cruz, Pedro Rangel Henriques

Publication date: 22 March 2013

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1822/14209


zbMATH Keywords

program analysisprogram slicingverification conditionscontrol flow graphs


Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)


Related Items (2)

Abstract Program Slicing ⋮ Cut branches before looking for bugs: certifiably sound verification on relaxed slices


Uses Software

  • ACSL
  • JML
  • Spec#
  • Boogie
  • KeY


Cites Work

  • Unnamed Item
  • Verification conditions for source-level imperative programs
  • Avoiding exponential explosion
  • An axiomatic basis for computer programming


This page was built for publication: Assertion-based slicing and slice graphs

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