Titlebook: Integrated Formal Methods; 14th International C Carlo A. Furia,Kirsten Winter Conference proceedings 2018 Springer Nature Switzerland AG 20

advocate

書(shū)目名稱Integrated Formal Methods影響因子(影響力)




書(shū)目名稱Integrated Formal Methods影響因子(影響力)學(xué)科排名




書(shū)目名稱Integrated Formal Methods網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Integrated Formal Methods網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Integrated Formal Methods被引頻次




書(shū)目名稱Integrated Formal Methods被引頻次學(xué)科排名




書(shū)目名稱Integrated Formal Methods年度引用




書(shū)目名稱Integrated Formal Methods年度引用學(xué)科排名




書(shū)目名稱Integrated Formal Methods讀者反饋




書(shū)目名稱Integrated Formal Methods讀者反饋學(xué)科排名

Indebted

A Precise Pictorial Language for Array Invariants,ransition graphs where preconditions, postconditions and invariants, rather than the program code, determine the main program structure. We demonstrate the approach with three examples, verified using the Why3 theorem prover frontend.

沙發(fā)

State-of-the-Art Model Checking for B and Event-B Using P,B and LTS,rtial order reduction and proper multi-core model checking are now available. The (improved) performance of this advanced tool link is benchmarked on a series of models with various sizes and compared to P.B.

合唱隊(duì)

,Task Planning with OMT: An?Application to Production Logistics,r we discuss our experience using Optimization Modulo Theories to synthesize . plans for multi-robot teams handling production processes within the RoboCup Logistics League. Besides presenting our results, we discuss challenges and possible directions for future development of OMT planning.

演講

太空

聯(lián)邦

動(dòng)作謎

繼而發(fā)生

,Making Linearizability Compositional for?Partially Ordered Executions,d related models. Our method is an adaptation of simulation-based methods, but in contrast to other such methods, it does not require that the implementation totally orders its events. We apply our proof technique and show correctness of the Treiber stack that blocks on empty, annotated with C11 release-acquire synchronisation.

Distribution

Security Protocol Analysis in Context: Computing Minimal Executions Using SMT and CPSA,er (i.e.?the preorder of injective homomorphisms); we discuss the merits of each. Our main technical contributions are algorithms for building homomorphism-minimal models and for generating a set-of-support for the models of a theory, in each case by scripting interactions with an SMT solver.