default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th ICFEM 2017: Xi'an, China
- Zhenhua Duan, Luke Ong:
Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, ICFEM 2017, Xi'an, China, November 13-17, 2017, Proceedings. Lecture Notes in Computer Science 10610, Springer 2017, ISBN 978-3-319-68689-9
Invited Talk
- Wang Yi:
Towards Customizable CPS: Composability, Efficiency and Predictability. 3-15
Contributed Papers
- Fabian Benduhn, Thomas Thüm, Ina Schaefer, Gunter Saake:
Modularization of Refinement Steps for Agile Formal Methods. 19-35 - Taolue Chen
, Fu Song, Zhilin Wu:
Model Checking Pushdown Epistemic Game Structures. 36-53 - Xiaohong Chen, Ling Yin, Yijun Yu, Zhi Jin:
Transforming Timing Requirements into CCSL Constraints to Verify Cyber-Physical Systems. 54-70 - Yihai Chen, Bofang Zhang, Ridha Khédri, Huaikou Miao:
A Framework for Multi-view Reconciliation and for Medical Devices Personalization. 71-87 - Sylvain Conchon, David Declerck, Fatiha Zaïdi:
Compiling Parameterized X86-TSO Concurrent Programs to Cubicle- W. 88-104 - Patrick Doolan, Graeme Smith, Chenyi Zhang, Padmanabhan Krishnan:
Improving the Scalability of Automatic Linearizability Checking in SPIN. 105-121 - Zhao Duan, Cong Tian, Zhenhua Duan:
Verifying Temporal Properties of C Programs via Lazy Abstraction. 122-139 - Marie Farrell, Rosemary Monahan, James F. Power:
Combining Event-B and CSP: An Institution Theoretic Approach to Interoperability. 140-156 - Thomas Göthel, Nils Jähnig, Simon Seif:
Refinement-Based Modelling and Verification of Design Patterns for Self-adaptive Systems. 157-173 - Long H. Pham, Lyly Tran Thi, Jun Sun:
Assertion Generation Through Active Learning. 174-191 - Hao Jiang, Hongli Yang, Shengchao Qin, Zhendong Su, Jian Zhang, Jun Yan:
Detecting Energy Bugs in Android Apps Using Static Analysis. 192-208 - Juliana Küster Filipe Bowles, Marco B. Caminati:
A Flexible Approach for Finding Optimal Paths with Minimal Conflicts. 209-225 - Xuan Bach Le, Thanh-Toan Nguyen, Wei-Ngan Chin, Aquinas Hobor:
A Certified Decision Procedure for Tree Shares. 226-242 - Jiaying Li, Jun Sun, Bo Gao, Étienne André:
Classification-Based Parameter Synthesis for Parametric Timed Automata. 243-261 - Li Li, Naipeng Dong, Jun Pang, Jun Sun, Guangdong Bai, Yang Liu, Jin Song Dong:
A Verification Framework for Stateful Security Protocols. 262-280 - Xin Li, Mizuhito Ogawa:
A Sliding-Window Algorithm for On-The-Fly Interprocedural Program Analysis. 281-297 - Si Liu, Peter Csaba Ölveczky, Jatin Ganhotra, Indranil Gupta, José Meseguer:
Exploring Design Alternatives for RAMP Transactions Through Statistical Model Checking. 298-314 - Yunhao Liu, Xiaohong Li, Zhiyong Feng, Jianye Hao:
An Improved Android Collusion Attack Detection Method Based on Program Slicing. 315-331 - Dongjing Miao, Zhipeng Cai:
Parameterized Complexity of Resilience Decision for Database Debugging. 332-344 - Adnan Rashid, Osman Hasan:
Formal Analysis of Linear Control Systems Using Theorem Proving. 345-361 - Manuel Töws, Heike Wehrheim:
Policy Dependent and Independent Information Flow Analyses. 362-378 - Jingyi Wang, Xiaohong Chen, Jun Sun, Shengchao Qin:
Improving Probability Estimation Through Active Probabilistic Model Learning. 379-395 - Yuwei Wang, Yunqing Wen, Guoqiang Li, Shoji Yuen:
Nested Timed Automata with Diagonal Constraints. 396-412 - Tingting Wu, Yunwei Dong, Tsong Yueh Chen, Mingyue Jiang, Man Fai Lau, Fei-Ching Kuo, Sebastian Ng:
Integration of Metamorphic Testing with Program Repair Methods Based on Adaptive Search Strategies and Program Equivalence. 413-429 - Zhiwu Xu, Cheng Wen, Shengchao Qin:
Learning Types for Binaries. 430-446 - Yi Yin, Yuichiro Tateiwa, Yun Wang, Yoshiaki Katayama, Naohisa Takahashi:
Inconsistency Analysis of Time-Based Security Policy and Firewall Policy. 447-463 - Yuxin Deng, Min Zhang, Guoqing Lei:
An Algebraic Approach to Automatic Reasoning for NetKAT Based on Its Operational Semantics. 464-480 - Zhengkui Zhang, Brian Nielsen, Kim Guldstrand Larsen, Gilles Nies, Marvin Stenger, Holger Hermanns:
Pareto Optimal Reachability Analysis for Simple Priced Timed Automata. 481-495
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-04 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
