[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M6CX2YZHBSXK1YTZ08QKQJAM":3,"skill-same:01M6CX2YZHBSXK1YTZ08QKQJAM":83},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":15,"categories":16,"keywords":17,"publishedAt":25,"linkOnly":26,"markdownContent":27,"markdownBody":28,"frontMatter":29,"refName":33,"commitSha":34,"skillDirectory":5,"forksCount":35,"repositoryHtmlUrl":36,"repositoryHomepageUrl":6,"ownerHtmlUrl":37,"ownerBlogUrl":6,"ownerDescription":6,"updatedAt":38,"install":39,"resources":52},"01M6CX2YZHBSXK1YTZ08QKQJAM","formal-methods",null,"Formal verification methods","ffsshhttiikk\u002Fopencode-agents-skills","ffsshhttiikk","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F226346827?v=4","01M6CWD9RR3Y7VRQX3MXYC8FYH","01M6CWD9WVPYAZW0J82G1VKGHY",3,"MIT","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fformal-methods\u002FSKILL.md",[],[18,19,20,21,22,23,24],"methods","formal methods","verification","science","computer","opencode","formal verification","2026-11-10 10:12:30",false,"---\nname: formal-methods\ndescription: Formal verification methods\nlicense: MIT\ncompatibility: opencode\nmetadata:\n  audience: developers\n  category: computer-science\n---\n\n## What I do\n- Specify system behavior formally\n- Verify correctness of algorithms\n- Prove properties about programs\n- Model check systems\n\n## When to use me\nWhen building high-assurance systems where correctness is critical.\n\n## Formal Specification\n\n### Pre\u002FPost Conditions\n```python\nclass FormalSpec:\n    \"\"\"Design by contract\"\"\"\n    \n    def requires(self, *conditions):\n        \"\"\"Precondition decorator\"\"\"\n        def decorator(func):\n            def wrapper(*args, **kwargs):\n                for i, cond in enumerate(conditions):\n                    if not cond(args[i] if i \u003C len(args) else None):\n                        raise PreconditionViolation(\n                            f\"Precondition {cond.__name__} failed\"\n                        )\n                return func(*args, **kwargs)\n            return wrapper\n        return decorator\n    \n    def ensures(self, *conditions):\n        \"\"\"Postcondition decorator\"\"\"\n        def decorator(func):\n            def wrapper(*args, **kwargs):\n                result = func(*args, **kwargs)\n                for cond in conditions:\n                    if not cond(result):\n                        raise PostconditionViolation(\n                            f\"Postcondition {cond.__name__} failed\"\n                        )\n                return result\n            return wrapper\n        return decorator\n\n\n# Example: Sorted list specification\ndef is_sorted(lst: list) -> bool:\n    \"\"\"Postcondition: list is sorted\"\"\"\n    for i in range(len(lst) - 1):\n        if lst[i] > lst[i + 1]:\n            return False\n    return True\n\n\ndef non_negative(x: int) -> bool:\n    \"\"\"Precondition: x is non-negative\"\"\"\n    return x >= 0\n\n\ndef sorted_insert(lst: list, x: int) -> list:\n    \"\"\"Insert x into sorted list lst\"\"\"\n    result = lst + [x]\n    result.sort()\n    return result\n```\n\n### Invariants\n```python\nclass Invariant:\n    \"\"\"Class and loop invariants\"\"\"\n    \n    @staticmethod\n    def class_invariant(cls):\n        \"\"\"Decorator for class invariant\"\"\"\n        original_init = cls.__init__\n        \n        def new_init(self, *args, **kwargs):\n            original_init(self, *args, **kwargs)\n            if not cls.invariant(self):\n                raise InvariantViolation(\"Class invariant violated\")\n        \n        cls.__init__ = new_init\n        \n        # Check invariant after each public method\n        original_methods = [m for m in dir(cls) \n                          if not m.startswith('_') \n                          and callable(getattr(cls, m))]\n        \n        for method_name in original_methods:\n            original_method = getattr(cls, method_name)\n            \n            def make_wrapper(method):\n                def wrapper(self, *args, **kwargs):\n                    result = method(self, *args, **kwargs)\n                    if not cls.invariant(self):\n                        raise InvariantViolation(\n                            f\"Invariant violated after {method_name}\"\n                        )\n                    return result\n                return wrapper\n            \n            setattr(cls, method_name, make_wrapper(original_method))\n        \n        return cls\n\n\n# Example: Stack invariant\n@Invariant\nclass Stack:\n    def __init__(self, capacity: int):\n        self.items = []\n        self.capacity = capacity\n    \n    def invariant(self):\n        \"\"\"Stack invariant\"\"\"\n        return (\n            len(self.items) >= 0 and\n            len(self.items) \u003C= self.capacity\n        )\n    \n    def push(self, item):\n        if len(self.items) >= self.capacity:\n            raise OverflowError(\"Stack overflow\")\n        self.items.append(item)\n    \n    def pop(self):\n        if not self.items:\n            raise IndexError(\"Stack underflow\")\n        return self.items.pop()\n```\n\n### Formal Verification\n\n### Hoare Logic\n```python\nclass HoareTriple:\n    \"\"\"Hoare logic for program verification\"\"\"\n    \n    @staticmethod\n    def verify(Pre: Callable, program: Callable, \n              Post: Callable) -> bool:\n        \"\"\"Verify Hoare triple: {P} program {Q}\"\"\"\n        # In practice, use theorem prover\n        pass\n    \n    @staticmethod\n    def assignment(x: str, expr: str, post: str) -> str:\n        \"\"\"Hoare rule for assignment: {Q[x\u002FE]} x := E {Q}\"\"\"\n        return f\"{{{post.replace(x, expr)}}}\"\n    \n    @staticmethod\n    def sequence(stmts: List[str], pre: str, post: str) -> str:\n        \"\"\"Hoare rule for sequence\"\"\"\n        # {P} S1; S2 {R} from {P} S1 {Q}; {Q} S2 {R}\n        return pre\n    \n    @staticmethod\n    def conditional(pre: str, cond: str, \n                   post_then: str, post_else: str) -> str:\n        \"\"\"Hoare rule for if\"\"\"\n        # {P} if B then {Q} else {R} from {P && B} S1 {Q} and {P && !B} S2 {R}\n        return f\"{{{pre}}}\"\n```\n\n### Model Checking\n```python\nclass ModelChecker:\n    \"\"\"Simple model checker\"\"\"\n    \n    def __init__(self):\n        self.states = set()\n        self.transitions = {}\n        self.properties = []\n    \n    def add_state(self, state: str):\n        self.states.add(state)\n    \n    def add_transition(self, from_state: str, to_state: str, \n                      action: str):\n        if from_state not in self.transitions:\n            self.transitions[from_state] = []\n        self.transitions[from_state].append((action, to_state))\n    \n    def check_reachability(self, start: str, goal: str) -> bool:\n        \"\"\"Check if goal is reachable from start\"\"\"\n        visited = set()\n        stack = [start]\n        \n        while stack:\n            state = stack.pop()\n            if state == goal:\n                return True\n            if state in visited:\n                continue\n            \n            visited.add(state)\n            \n            for _, next_state in self.transitions.get(state, []):\n                stack.append(next_state)\n        \n        return False\n    \n    def check_liveness(self, start: str, good_states: Set[str]) -> bool:\n        \"\"\"Check liveness: eventually reach good state\"\"\"\n        visited = set()\n        stack = [start]\n        \n        while stack:\n            state = stack.pop()\n            if state in visited:\n                continue\n            \n            visited.add(state)\n            \n            if state in good_states:\n                return True\n            \n            for _, next_state in self.transitions.get(state, []):\n                stack.append(next_state)\n        \n        return False\n    \n    def check_safety(self, start: str, \n                    bad_states: Set[str]) -> bool:\n        \"\"\"Check safety: never reach bad state\"\"\"\n        return not self.check_reachability(start, \n            bad_states.pop() if bad_states else None)\n```\n","## What I do\n- Specify system behavior formally\n- Verify correctness of algorithms\n- Prove properties about programs\n- Model check systems\n\n## When to use me\nWhen building high-assurance systems where correctness is critical.\n\n## Formal Specification\n\n### Pre\u002FPost Conditions\n```python\nclass FormalSpec:\n    \"\"\"Design by contract\"\"\"\n    \n    def requires(self, *conditions):\n        \"\"\"Precondition decorator\"\"\"\n        def decorator(func):\n            def wrapper(*args, **kwargs):\n                for i, cond in enumerate(conditions):\n                    if not cond(args[i] if i \u003C len(args) else None):\n                        raise PreconditionViolation(\n                            f\"Precondition {cond.__name__} failed\"\n                        )\n                return func(*args, **kwargs)\n            return wrapper\n        return decorator\n    \n    def ensures(self, *conditions):\n        \"\"\"Postcondition decorator\"\"\"\n        def decorator(func):\n            def wrapper(*args, **kwargs):\n                result = func(*args, **kwargs)\n                for cond in conditions:\n                    if not cond(result):\n                        raise PostconditionViolation(\n                            f\"Postcondition {cond.__name__} failed\"\n                        )\n                return result\n            return wrapper\n        return decorator\n\n\n# Example: Sorted list specification\ndef is_sorted(lst: list) -> bool:\n    \"\"\"Postcondition: list is sorted\"\"\"\n    for i in range(len(lst) - 1):\n        if lst[i] > lst[i + 1]:\n            return False\n    return True\n\n\ndef non_negative(x: int) -> bool:\n    \"\"\"Precondition: x is non-negative\"\"\"\n    return x >= 0\n\n\ndef sorted_insert(lst: list, x: int) -> list:\n    \"\"\"Insert x into sorted list lst\"\"\"\n    result = lst + [x]\n    result.sort()\n    return result\n```\n\n### Invariants\n```python\nclass Invariant:\n    \"\"\"Class and loop invariants\"\"\"\n    \n    @staticmethod\n    def class_invariant(cls):\n        \"\"\"Decorator for class invariant\"\"\"\n        original_init = cls.__init__\n        \n        def new_init(self, *args, **kwargs):\n            original_init(self, *args, **kwargs)\n            if not cls.invariant(self):\n                raise InvariantViolation(\"Class invariant violated\")\n        \n        cls.__init__ = new_init\n        \n        # Check invariant after each public method\n        original_methods = [m for m in dir(cls) \n                          if not m.startswith('_') \n                          and callable(getattr(cls, m))]\n        \n        for method_name in original_methods:\n            original_method = getattr(cls, method_name)\n            \n            def make_wrapper(method):\n                def wrapper(self, *args, **kwargs):\n                    result = method(self, *args, **kwargs)\n                    if not cls.invariant(self):\n                        raise InvariantViolation(\n                            f\"Invariant violated after {method_name}\"\n                        )\n                    return result\n                return wrapper\n            \n            setattr(cls, method_name, make_wrapper(original_method))\n        \n        return cls\n\n\n# Example: Stack invariant\n@Invariant\nclass Stack:\n    def __init__(self, capacity: int):\n        self.items = []\n        self.capacity = capacity\n    \n    def invariant(self):\n        \"\"\"Stack invariant\"\"\"\n        return (\n            len(self.items) >= 0 and\n            len(self.items) \u003C= self.capacity\n        )\n    \n    def push(self, item):\n        if len(self.items) >= self.capacity:\n            raise OverflowError(\"Stack overflow\")\n        self.items.append(item)\n    \n    def pop(self):\n        if not self.items:\n            raise IndexError(\"Stack underflow\")\n        return self.items.pop()\n```\n\n### Formal Verification\n\n### Hoare Logic\n```python\nclass HoareTriple:\n    \"\"\"Hoare logic for program verification\"\"\"\n    \n    @staticmethod\n    def verify(Pre: Callable, program: Callable, \n              Post: Callable) -> bool:\n        \"\"\"Verify Hoare triple: {P} program {Q}\"\"\"\n        # In practice, use theorem prover\n        pass\n    \n    @staticmethod\n    def assignment(x: str, expr: str, post: str) -> str:\n        \"\"\"Hoare rule for assignment: {Q[x\u002FE]} x := E {Q}\"\"\"\n        return f\"{{{post.replace(x, expr)}}}\"\n    \n    @staticmethod\n    def sequence(stmts: List[str], pre: str, post: str) -> str:\n        \"\"\"Hoare rule for sequence\"\"\"\n        # {P} S1; S2 {R} from {P} S1 {Q}; {Q} S2 {R}\n        return pre\n    \n    @staticmethod\n    def conditional(pre: str, cond: str, \n                   post_then: str, post_else: str) -> str:\n        \"\"\"Hoare rule for if\"\"\"\n        # {P} if B then {Q} else {R} from {P && B} S1 {Q} and {P && !B} S2 {R}\n        return f\"{{{pre}}}\"\n```\n\n### Model Checking\n```python\nclass ModelChecker:\n    \"\"\"Simple model checker\"\"\"\n    \n    def __init__(self):\n        self.states = set()\n        self.transitions = {}\n        self.properties = []\n    \n    def add_state(self, state: str):\n        self.states.add(state)\n    \n    def add_transition(self, from_state: str, to_state: str, \n                      action: str):\n        if from_state not in self.transitions:\n            self.transitions[from_state] = []\n        self.transitions[from_state].append((action, to_state))\n    \n    def check_reachability(self, start: str, goal: str) -> bool:\n        \"\"\"Check if goal is reachable from start\"\"\"\n        visited = set()\n        stack = [start]\n        \n        while stack:\n            state = stack.pop()\n            if state == goal:\n                return True\n            if state in visited:\n                continue\n            \n            visited.add(state)\n            \n            for _, next_state in self.transitions.get(state, []):\n                stack.append(next_state)\n        \n        return False\n    \n    def check_liveness(self, start: str, good_states: Set[str]) -> bool:\n        \"\"\"Check liveness: eventually reach good state\"\"\"\n        visited = set()\n        stack = [start]\n        \n        while stack:\n            state = stack.pop()\n            if state in visited:\n                continue\n            \n            visited.add(state)\n            \n            if state in good_states:\n                return True\n            \n            for _, next_state in self.transitions.get(state, []):\n                stack.append(next_state)\n        \n        return False\n    \n    def check_safety(self, start: str, \n                    bad_states: Set[str]) -> bool:\n        \"\"\"Check safety: never reach bad state\"\"\"\n        return not self.check_reachability(start, \n            bad_states.pop() if bad_states else None)\n```\n",{"name":5,"license":14,"metadata":30,"description":7,"compatibility":23},{"audience":31,"category":32},"developers","computer-science","main","5f7a3e453c98261f93d19a6a7de44ad8f7b72d41",2,"https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk","2026-03-01 06:55:40",{"source":8,"skillName":5,"commands":40,"prompt":50,"zipAvailable":51},[41,44,47],{"tool":42,"command":43},"npx","npx skills add ffsshhttiikk\u002Fopencode-agents-skills --skill formal-methods",{"tool":45,"command":46},"bunx","bunx skills add ffsshhttiikk\u002Fopencode-agents-skills --skill formal-methods",{"tool":48,"command":49},"pnpm","pnpm dlx skills add ffsshhttiikk\u002Fopencode-agents-skills --skill formal-methods","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fformal-methods\u002FSKILL.md",true,[53,59,63,69,73,77],{"path":54,"resourceType":55,"resourceTypeDesc":56,"sizeBytes":57,"sourceHtmlUrl":58},"assets\u002Fintake-example.json","ASSET","资产文件",549,"https:\u002F\u002Fgithub.com\u002FFDU-INS\u002FInsurance-Skills\u002Fblob\u002Fmain\u002FSkills\u002Funderwriting-questionnaire-precheck-assistant\u002Fassets\u002Fintake-example.json",{"path":60,"resourceType":55,"resourceTypeDesc":56,"sizeBytes":61,"sourceHtmlUrl":62},"assets\u002Fprecheck-report-template.md",723,"https:\u002F\u002Fgithub.com\u002FFDU-INS\u002FInsurance-Skills\u002Fblob\u002Fmain\u002FSkills\u002Funderwriting-questionnaire-precheck-assistant\u002Fassets\u002Fprecheck-report-template.md",{"path":64,"resourceType":65,"resourceTypeDesc":66,"sizeBytes":67,"sourceHtmlUrl":68},"references\u002Foutput-schema.md","REFERENCE","参考文档",2889,"https:\u002F\u002Fgithub.com\u002FFDU-INS\u002FInsurance-Skills\u002Fblob\u002Fmain\u002FSkills\u002Funderwriting-questionnaire-precheck-assistant\u002Freferences\u002Foutput-schema.md",{"path":70,"resourceType":65,"resourceTypeDesc":66,"sizeBytes":71,"sourceHtmlUrl":72},"references\u002Freview-dimensions.md",3600,"https:\u002F\u002Fgithub.com\u002FFDU-INS\u002FInsurance-Skills\u002Fblob\u002Fmain\u002FSkills\u002Funderwriting-questionnaire-precheck-assistant\u002Freferences\u002Freview-dimensions.md",{"path":74,"resourceType":65,"resourceTypeDesc":66,"sizeBytes":75,"sourceHtmlUrl":76},"references\u002Frisk-signals.md",3080,"https:\u002F\u002Fgithub.com\u002FFDU-INS\u002FInsurance-Skills\u002Fblob\u002Fmain\u002FSkills\u002Funderwriting-questionnaire-precheck-assistant\u002Freferences\u002Frisk-signals.md",{"path":78,"resourceType":79,"resourceTypeDesc":80,"sizeBytes":81,"sourceHtmlUrl":82},"scripts\u002Fgenerate_precheck_report.py","SCRIPT","脚本",12720,"https:\u002F\u002Fgithub.com\u002FFDU-INS\u002FInsurance-Skills\u002Fblob\u002Fmain\u002FSkills\u002Funderwriting-questionnaire-precheck-assistant\u002Fscripts\u002Fgenerate_precheck_report.py",[84,95,104,113,123,132],{"skillNo":85,"name":86,"nameZh":6,"description":87,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":88,"categories":89,"keywords":90,"publishedAt":25},"01M6CXT9TXDF79BWJTMQAPB49G","xamarin","Xamarin cross-platform development","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fxamarin\u002FSKILL.md",[],[86,91,92,93,23,94],"platform","cross-platform","mobile","development",{"skillNo":96,"name":97,"nameZh":6,"description":98,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":99,"categories":100,"keywords":101,"publishedAt":25},"01M6CXT8AD04MFYDA32VW3FKAG","wrangling","Data wrangling fundamentals","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwrangling\u002FSKILL.md",[],[97,102,23,21,103],"data wrangling","data",{"skillNo":105,"name":106,"nameZh":6,"description":107,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":108,"categories":109,"keywords":110,"publishedAt":25},"01M6CXT717GCN7SRRNPBDP4508","windows","Windows operating system administration and scripting","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwindows\u002FSKILL.md",[],[106,111,23,112],"system","scripting",{"skillNo":114,"name":115,"nameZh":6,"description":116,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":117,"categories":118,"keywords":119,"publishedAt":25},"01M6CXT54K794NMEM3XAPZZDKT","wide-column","Wide-column data model","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwide-column\u002FSKILL.md",[],[120,121,23,122,103],"wide column","databases","model",{"skillNo":124,"name":125,"nameZh":6,"description":126,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":127,"categories":128,"keywords":129,"publishedAt":25},"01M6CXT28FMT2P4V9GZE67WA8E","wide-column-stores","Wide-column database stores","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwide-column-stores\u002FSKILL.md",[],[130,121,23,131],"wide column stores","database",{"skillNo":133,"name":134,"nameZh":6,"description":135,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":136,"categories":137,"keywords":138,"publishedAt":25},"01M6CXT0D0M0Q4T2N7C2RX7DSN","websockets","WebSocket implementation and best practices","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwebsockets\u002FSKILL.md",[],[134,139,140,141,23,142,143],"websocket","real-time","time","best practices","implementation"]