有其法作用 发表于 2025-3-30 12:16:08
http://reply.papertrans.cn/99/9818/981724/981724_51.pngInduction 发表于 2025-3-30 16:27:03
Thread-Modular Shape Analysisthreads. This idea reduces the exponential complexity due to thread interleaving and allows us to handle programs with an unbounded number of threads..Thread-modular static analyses face a major problem in simultaneously requiring a separation of the reasoning done for each thread, for efficiency puMOTIF 发表于 2025-3-30 18:37:19
http://reply.papertrans.cn/99/9818/981724/981724_53.png可卡 发表于 2025-3-30 21:11:49
Verification of Security Protocolsrious goals depending on the application: confidentiality, authenticity, privacy, anonymity, fairness, etc. Their verification using symbolic models has shown its interest for detecting attacks and proving security properties. A famous example is the Needham-Schroeder protocol on which G. LoweResection 发表于 2025-3-31 00:54:57
Towards Automatic Stability Analysis for Rely-Guarantee Proofses in the proof must be proved invariant (or stable) under interference from the environment. We describe a framework, and a prototype implementation, for automatically detecting and repairing instability in such proofs. The method uses a combination of model checking, abstract interpretation, SMT aconcert 发表于 2025-3-31 05:52:00
http://reply.papertrans.cn/99/9818/981724/981724_56.png搏斗 发表于 2025-3-31 09:29:32
The Higher-Order Aggregate Update Problem, including unrestricted closures and nested arrays. Also, it can handle programs that contain a mix of functional and destructive updates. Correctness of all the analyses and of the transformation itself is proved.专心 发表于 2025-3-31 16:40:00
http://reply.papertrans.cn/99/9818/981724/981724_58.pngextinguish 发表于 2025-3-31 20:45:37
http://reply.papertrans.cn/99/9818/981724/981724_59.pngcollateral 发表于 2025-4-1 01:20:26
LTL Generalized Model Checking Revisitedeneralized model checking (GMC) checks whether there exists a concretization of that abstraction that satisfies the formula. In this paper, we revisit generalized model checking for linear time (LTL) properties. First, we show that LTL GMC is 2EXPTIME-complete in the size of the formula and polynomi