Extended static checking. This paper provides an overview of Extended Static Checking (ESC), a new technology that we have studied here at the Compaq (née Digital) Systems Research Center for much of the 1990s. We have implemented and experimented with two Extended Static Checkers, one for Modula-3, and another checker for Java. The aim of ESC is to increase software productivity by providing practical static checking tools for programmers. In general, static checking finds errors statically, that is, without running the program, and therefore can find errors earlier in the design process than dynamic checking such as testing. Since the cost of correcting an error is reduced if it is detected early, improved static checking has the potential to increase software productivity.

References in zbMATH (referenced in 114 articles , 1 standard article )

Showing results 1 to 20 of 114.
Sorted by year (citations)

1 2 3 4 5 6 next

  1. Bonacina, Maria Paola; Plaisted, David A.: Semantically-guided goal-sensitive reasoning: model representation (2016)
  2. Dross, Claire; Conchon, Sylvain; Kanig, Johannes; Paskevich, Andrei: Adding decision procedures to SMT solvers using axioms with triggers (2016)
  3. Galán, Francisco J.; Cañete-Valdeón, José M.: Synthesis of positive logic programs for checking a class of definitions with infinite quantification (2016)
  4. Hyvärinen, Antti E.J.; Marescotti, Matteo; Alt, Leonardo; Sharygina, Natasha: Opensmt2: an SMT solver for multi-core and cloud computing (2016)
  5. Alberti, Francesco; Ghilardi, Silvio; Sharygina, Natasha: Decision procedures for flat array properties (2015)
  6. Bonacina, Maria Paola; Johansson, Moa: On interpolation in automated theorem proving (2015)
  7. Bonacina, Maria Paola; Johansson, Moa: Interpolation systems for ground proofs in automated deduction: a survey (2015)
  8. Grechanik, S.A.: Proving properties of functional programs by equality saturation (2015)
  9. Kuncak, Viktor: Verifying and synthesizing software with recursive functions (invited contribution) (2014)
  10. Leino, K.Rustan M.: Automating theorem proving with SMT (2013)
  11. Lynch, Christopher; Ta, Quang-Trung; Tran, Duc-Khanh: SMELS: satisfiability modulo equality with lazy superposition (2013)
  12. Brumley, Billy B.; Barbosa, Manuel; Page, Dan; Vercauteren, Frederik: Practical realisation and elimination of an ECC-related software bug attack (2012)
  13. Chin, Wei-Ngan; David, Cristina; Nguyen, Huu Hai; Qin, Shengchao: Automated verification of shape, size and bag properties via user-defined predicates in separation logic (2012)
  14. Cousot, Patrick; Cousot, Radhia; Mauborgne, Laurent: Theories, solvers and static analysis by abstract interpretation (2012)
  15. Echenim, Mnacho; Peltier, Nicolas: An instantiation scheme for satisfiability modulo theories (2012)
  16. Fuchs, Alexander; Goel, Amit; Grundy, Jim; Krstić, Sava; Tinelli, Cesare: Ground interpolation for the theory of equality (2012)
  17. Köksal, Ali Sinan; Kuncak, Viktor; Suter, Philippe: Constraints as control (2012)
  18. Shved, P.E.; Mutilin, V.S.; Mandrykin, M.U.: Experience of improving the BLAST static verification tool (2012)
  19. Thamsborg, Jacob; Birkedal, Lars; Yang, Hongseok: Two for the price of one: lifting separation logic assertions (2012)
  20. Besson, Frédéric; Cornilleau, Pierre-Emmanuel; Pichardie, David: Modular SMT proofs for fast reflexive checking inside Coq (2011)

1 2 3 4 5 6 next