Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Oren Ish-Shalom"'
Publikováno v:
ACM Transactions on Programming Languages and Systems. 44:1-36
Determining upper bounds on the time complexity of a program is a fundamental problem with a variety of applications, such as performance debugging, resource certification, and compile-time optimizations. Automated techniques for cost analysis excel
Publikováno v:
Programming Languages and Systems-30th European Symposium on Programming, ESOP 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings
Programming Languages and Systems ISBN: 9783030720186
ESOP
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Programming Languages and Systems
Programming Languages and Systems ISBN: 9783030720186
ESOP
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Programming Languages and Systems
Determining upper bounds on the time complexity of a program is a fundamental problem with a variety of applications, such as performance debugging, resource certification, and compile-time optimizations. Automated techniques for cost analysis excel
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030393212
VMCAI
VMCAI
We present a novel approach based on supervised machine-learning for inverting String Manipulating Procedures (SMPs), i.e., given an SMP \(p:\bar{\Sigma }\rightarrow \bar{\Sigma }\), we compute a partial pseudo-inverse function \(p^{-1}\) such that g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b052159f51dd6b5d6fec54f245505428
https://doi.org/10.1007/978-3-030-39322-9_9
https://doi.org/10.1007/978-3-030-39322-9_9
Publikováno v:
Verification, Model Checking, and Abstract Interpretation-21st International Conference, VMCAI 2020, New Orleans, LA, USA, January 16–21, 2020, Proceedings
Lecture Notes in Computer Science ISBN: 9783030393212
VMCAI
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science ISBN: 9783030393212
VMCAI
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Verification, Model Checking, and Abstract Interpretation
Automatic verification of array manipulating programs is a challenging problem because it often amounts to the inference of inductive quantified loop invariants which, in some cases, may not even be first-order expressible. In this paper, we suggest
Publikováno v:
PLDI
ACM SIGPLAN Conference on Programming Language Design and Implementation
ACM SIGPLAN Conference on Programming Language Design and Implementation
Analysing and comprehending C programs that use stringsis hard: Using standard library functions for manipulatingstrings is not enforced and programs often use complex loopsfor the same purpose. We introduce the notion of memorylessloops that capture