Shengchao Qin
Teesside University, School of Computing, Faculty Member
To solve the problem of output signal interference noise of non-driven gyroscope, digital filtering is considered on the gyro signal. The spectrum function expression of non-driven micro-gyroscope is derived. The impact of rectangular... more
To solve the problem of output signal interference noise of non-driven gyroscope, digital filtering is considered on the gyro signal. The spectrum function expression of non-driven micro-gyroscope is derived. The impact of rectangular window on its spectrum is analysed followed by experiment to test and verify the results. Finally, based on the characteristics that the useful frequency band of gyro signal lays in the low frequency one, a low-pass filter is designed by using MATLAB.
The ecological restoration and revegetation of high-steep rock slopes is very difficult in highway construction in the mountain area. The traditional methods of revegetation such as borrowed-soil spraying, hydro seeding are very difficult... more
The ecological restoration and revegetation of high-steep rock slopes is very difficult in highway construction in the mountain area. The traditional methods of revegetation such as borrowed-soil spraying, hydro seeding are very difficult to achieve good results. This paper presents the ecosystem, composed by green geonet which can be defined as geomask net and climbing plants, its structure, construction technology and short and long term ecological effect.
This book constitutes the refereed proceedings of the 13th International Conference on Formal Engineering Methods, ICFEM 2011, held in Durham, UK, October 2011. The 40 revised full papers together with 3 invited talks presented were... more
This book constitutes the refereed proceedings of the 13th International Conference on Formal Engineering Methods, ICFEM 2011, held in Durham, UK, October 2011. The 40 revised full papers together with 3 invited talks presented were carefully reviewed and selected from 103 submissions. The papers address all current issues in formal methods and their applications in software engineering.
Abstract Periodic control systems (PCS) are widely used in the embedded industry like aerospace and automotive. Such systems usually run periodic tasks and respond to the external signals. Based on our previous work on Mode diagram... more
Abstract Periodic control systems (PCS) are widely used in the embedded industry like aerospace and automotive. Such systems usually run periodic tasks and respond to the external signals. Based on our previous work on Mode diagram modeling (MDM) notations for specifying the periodic control system, we present the stochastic semantics for MDM in this paper. The stochastic semantics of MDM is based on the Markov chain.
Web services have become more and more important in these years, and BPEL4WS (BPEL) is the OASIS standard for web services composition and orchestration. It contains several distinct features, including scope-based compensation and fault... more
Web services have become more and more important in these years, and BPEL4WS (BPEL) is the OASIS standard for web services composition and orchestration. It contains several distinct features, including scope-based compensation and fault handling mechanism. This paper focuses on the verification of BPEL programs, especially the verification of concurrent BPEL programs. The rely/guarantee approach is applied. Firstly, we present the operational semantics for BPEL programs.
Abstract Locks are pervasive in multithreaded code. For software transactional memory (STM) to be widely adopted there must be a consensus on a semantics for programs that entail both locks and transactions, particularly for weakly... more
Abstract Locks are pervasive in multithreaded code. For software transactional memory (STM) to be widely adopted there must be a consensus on a semantics for programs that entail both locks and transactions, particularly for weakly isolated STMs. For instance, in a weakly isolated STM, use of both locks and transactions to access the same data may introduce data races. In response we present a simple and intuitive semantics that guarantees ordered linearisation points for conflicting locks and transactions.
This book constitutes the refereed proceedings of the 13th International Conference on Formal Engineering Methods, ICFEM 2011, held in Durham, UK, October 2011. The 40 revised full papers together with 3 invited talks presented were... more
This book constitutes the refereed proceedings of the 13th International Conference on Formal Engineering Methods, ICFEM 2011, held in Durham, UK, October 2011. The 40 revised full papers together with 3 invited talks presented were carefully reviewed and selected from 103 submissions. The papers address all current issues in formal methods and their applications in software engineering.
Abstract Structures The object references that exist in object-oriented models of abstract recursive structures such as trees or directed acyclic graphs (DAGs) often satisfy the combinatorial properties of object containment, and hence... more
Abstract Structures The object references that exist in object-oriented models of abstract recursive structures such as trees or directed acyclic graphs (DAGs) often satisfy the combinatorial properties of object containment, and hence the geometry of object containment can be applied directly when constructing object-oriented models for such structures. As an illustration, consider the following (partial) Object-Z specifications of a tree node and a DAG node where T is a generic type.
Abstract: Periodic control systems used in spacecrafts and automotives are usually period-driven and can be decomposed into different modes with each mode representing a system state observed from outside. Such systems may also involve... more
Abstract: Periodic control systems used in spacecrafts and automotives are usually period-driven and can be decomposed into different modes with each mode representing a system state observed from outside. Such systems may also involve intensive computing in their modes. Despite the fact that such control systems are widely used in the above-mentioned safety-critical embedded domains, there is lack of domain-specific formal modelling languages for such systems in the relevant industry.
Abstract HighSpec is an interactive system for composing and checking OZTA specifications. The integrated high level specification language, OZTA, is a combination of Object-Z (OZ) and Timed Automata (TA). Building on the strength of... more
Abstract HighSpec is an interactive system for composing and checking OZTA specifications. The integrated high level specification language, OZTA, is a combination of Object-Z (OZ) and Timed Automata (TA). Building on the strength of Object-Z's in specifying data structures and Timed Automata's in modelling dynamic and real-time behaviors, OZTA is well suited for presenting complete and coherent requirement models for complex real-time systems.
We propose in this paper an algebraic approach to hard-ware/software partitioning in Verilog Hardware Description Language (HDL). We explore a collection of algebraic laws for Verilog programs, from which we design a set of syntax-based... more
We propose in this paper an algebraic approach to hard-ware/software partitioning in Verilog Hardware Description Language (HDL). We explore a collection of algebraic laws for Verilog programs, from which we design a set of syntax-based algebraic rules to conduct hardware/software partitioning. The co-specification language and the target hardware and software description languages are specific subsets of Verilog.
Verification of programs with invocations to unknown procedures is a practical problem, because in many scenarios not all codes of programs to be verified are available. Those unknown calls also pose a challenge for their verification.... more
Verification of programs with invocations to unknown procedures is a practical problem, because in many scenarios not all codes of programs to be verified are available. Those unknown calls also pose a challenge for their verification. This paper addresses this problem with an attempt to verify the full functional correctness of such programs using pointer-based data structures.
Abstract—We study LBI backward proof searches, presenting a precise analysis on how its structural rules interact with logical rules. In particular we study two sources of non-termination, one inherent in unary structural connectives and... more
Abstract—We study LBI backward proof searches, presenting a precise analysis on how its structural rules interact with logical rules. In particular we study two sources of non-termination, one inherent in unary structural connectives and one inherent in contraction, and develop a new BI sequent calculus LBI3, resolving the first problem altogether and restricting the second problem by absorbing contraction into logical inference rules.
Region-based memory management offers several important advantages over garbage-collected heap, including real-time performance, better data locality and efficient use of limited memory. The concept of regions was first introduced for a... more
Region-based memory management offers several important advantages over garbage-collected heap, including real-time performance, better data locality and efficient use of limited memory. The concept of regions was first introduced for a call-by-value functional language by Tofte and Talpin, and has since been advocated for imperative and object-oriented languages. Scope memory, a lexical variant of regions, is now a core feature in a recent proposal on Real-Time Specification for Java (RTSJ).
In design of dependable software for real-time embedded systems, time analysis is an important but challenging problem due in part to the randomicity and nondeterminism of interrupt handling behaviors. Time properties are generally... more
In design of dependable software for real-time embedded systems, time analysis is an important but challenging problem due in part to the randomicity and nondeterminism of interrupt handling behaviors. Time properties are generally determined by the behavior of the main program and the interrupt handling programs. In this paper, we present a small but expressive language for interrupt-driven programs and propose a timed operational semantics for it which can be used to explore various time properties.
Abstract JavaScript as a Web scripting language has been widely used following the fast growth of Internet. Due to the flexible and dynamic features offered by the JavaScript language, it has become a challenging problem to statically... more
Abstract JavaScript as a Web scripting language has been widely used following the fast growth of Internet. Due to the flexible and dynamic features offered by the JavaScript language, it has become a challenging problem to statically reason about code written in JavaScript. As a first step towards building a mechanised verification system for JavaScript, we present, in this paper, an axiomatic verification system for a core subset of JavaScript based on a variant of separation logic.
This paper advocates a general approach to formal verification by constructing property-oriented models. We instantiate the approach using timing properties, and construct a heterogeneous untimed model in which time is abstracted away, so... more
This paper advocates a general approach to formal verification by constructing property-oriented models. We instantiate the approach using timing properties, and construct a heterogeneous untimed model in which time is abstracted away, so that we can verify timing properties in an untimed framework. The correctness of property-oriented model construction is ensured by the conformance of semantic and syntactic mappings.
Separation logic-based abstraction mechanisms, enhanced with user-defined inductive predicates, represent a powerful, expressive means of specifying heap-based data structures with strong invariant properties. However, expressive power... more
Separation logic-based abstraction mechanisms, enhanced with user-defined inductive predicates, represent a powerful, expressive means of specifying heap-based data structures with strong invariant properties. However, expressive power comes at a cost: the manipulation of such logics typically requires the unfolding of disjunctive predicates which may lead to expensive proof search.
Abstract We present a new (size-) polymorphic type system (for an objectoriented language) that characterizes the sizes of data structures and the amount of heap and stack memory required to successfully execute methods that operate on... more
Abstract We present a new (size-) polymorphic type system (for an objectoriented language) that characterizes the sizes of data structures and the amount of heap and stack memory required to successfully execute methods that operate on these data structures.
Abstract. We synthesized high-resolution precisely-dated stalagmite records and historical document records from north central China to reconstruct a decadal resolution precipitation record during the last 1800 years (190–1980 AD). The... more
Abstract. We synthesized high-resolution precisely-dated stalagmite records and historical document records from north central China to reconstruct a decadal resolution precipitation record during the last 1800 years (190–1980 AD). The synthesized precipitation record shows coincident variations and significant positive correlations with the temperature reconstructions on centennial-to multidecadal-scale, suggesting warm-humid/cool-dry was the main climate pattern in north central China over the past 1800 years.
The integrated logic-based modeling language, Timed Communicating Object Z (TCOZ), is well suited for presenting complete and coherent requirement models for complex real-time systems. However, the challenge is how to verify the TCOZ... more
The integrated logic-based modeling language, Timed Communicating Object Z (TCOZ), is well suited for presenting complete and coherent requirement models for complex real-time systems. However, the challenge is how to verify the TCOZ models with tool support, especially for analyzing timing properties. Specialized graph-based modeling technique, Timed Automata (TA), has powerful mechanisms for designing real-time models using multiple clocks and has well developed automatic tool support.
Abstract We study automated verification of pointer safety for heap-manipulating imperative programs with unknown procedure calls or code pointers. Given the specification of a procedure whose body contains calls to an unknown procedure,... more
Abstract We study automated verification of pointer safety for heap-manipulating imperative programs with unknown procedure calls or code pointers. Given the specification of a procedure whose body contains calls to an unknown procedure, we try to infer the possible specifications for the unknown procedure from its calling contexts. We employ a forward shape analysis with separation logic and an abductive inference mechanism to synthesize both pre-and postconditions for the unknown procedure.
Abstract. Most software transactional memories employ optimistic concurrency control. A pessimistic semantics, however, is not without its benefits: its programming model is often much simpler to reason about and supports the execution of... more
Abstract. Most software transactional memories employ optimistic concurrency control. A pessimistic semantics, however, is not without its benefits: its programming model is often much simpler to reason about and supports the execution of irreversible operations. We present a programming model that supports both optimistic and pessimistic concurrency control semantics.
Research Interests:
Memory Usage Verification Using Hip/Sleek Guanhua He1, Shengchao Qin1, Chenguang Luo1, and Wei-Ngan Chin2 1 Durham University, Durham DH1 3LE, UK 2 National University of Singapore {guanhua. he, shengchao. qin, chenguang. luo}@ durham. ac.... more
Memory Usage Verification Using Hip/Sleek Guanhua He1, Shengchao Qin1, Chenguang Luo1, and Wei-Ngan Chin2 1 Durham University, Durham DH1 3LE, UK 2 National University of Singapore {guanhua. he, shengchao. qin, chenguang. luo}@ durham. ac. uk, chinwn@ ...
Research Interests:
Research Interests:
Research Interests: Algebra, Probability Theory, Computer Science, Parallel Computing, Software Engineering, and 25 moreFormal Methods (Formal Verification), Programming Languages, Program Semantics, Concurrent Programming Languages, Logic, Animation, Semantics, Programming Language Semantics, Parallel Programming, Programming Language Theory, Verification (Computer Science), Formal methods, Software systems verification, Formal Semantics, Semantics (Computer Science), Software Verification and Validation, Programming Language Design, Programming, Mathematical Sciences, Real Time Systems, Formal language, Formal Verification, Operational Semantics, Software Systems, and Normal Form
Research Interests:
... Unifying theories of programming. Post a Comment. CONTRIBUTORS: Author: Hoare, CAR (b. 1934, d. ----. ... VOLUME/EDITION: PAGES (INTRO/BODY): SUBJECT(S): Computer programming. DISCIPLINE: No discipline assigned. LC NUMBER: QA76.6.... more
... Unifying theories of programming. Post a Comment. CONTRIBUTORS: Author: Hoare, CAR (b. 1934, d. ----. ... VOLUME/EDITION: PAGES (INTRO/BODY): SUBJECT(S): Computer programming. DISCIPLINE: No discipline assigned. LC NUMBER: QA76.6. .H5735 1998. HTTP: ...